Computer Science, asked by aimankhanak2016, 3 months ago

Compare circular wait and deadlock avoidance schemes in terms of run time overhead.

Answers

Answered by jenishpun512

Explanation:

hdhdeueuehwhwhhshehshhwhwhs sorry iam here to gain points

Answered by Anonymous

Compare the circular-wait scheme with thedeadlock-avoidance schemes

(like the banker’salgorithm) with respect to the following issues:a. Runtime overheadsb. System throughputA deadlock-avoidance scheme tends to increase theruntime overheads due to the cost of keep track ofthe current resource allocation. However, a deadlock-avoidance scheme allows for more concurrent use ofresources than schemes that statically prevent theformation of deadlock. In that sense, a deadlockavoidance scheme could increase systemthroughput.

Previous Question

Next Question