Question: invoking the deadlock-detection algorithm for every resource request will incur considerable overhead in

Answer:

A less expensive alternative is simply to invoke the algorithm at defined intervals—for example,

Once per hour or whenever CPU utilization drops below 40 percent. (A deadlock eventually cripples system throughput and causes CPU utilization to drop.) If the detection algorithm is invoked at arbitrary points in time, the resource Graph may contain many cycles. In this case, we generally cannot tell which of the many deadlocked processes “caused” the deadlock.

MCQ: invoking the deadlock-detection algorithm for every resource request will incur considerable overhead in

A. seek time
B. invoke time
C. computation time
D. All of the above

Correct Answer: A. seek time

Explanation:

A less expensive alternative is simply to invoke the algorithm at defined intervals—for example,

Once per hour or whenever CPU utilization drops below 40 percent. (A deadlock eventually cripples system throughput and causes CPU utilization to drop.) If the detection algorithm is invoked at arbitrary points in time, the resource Graph may contain many cycles. In this case, we generally cannot tell which of the many deadlocked processes “caused” the deadlock.