Computer Science - Operating Systems Concepts - Discussion

Discussion Forum : Operating Systems Concepts - Section 2 (Q.No. 25)
25.
What problem is solved by Dijkstra's banker's algorithm?
mutual exclusion
deadlock recovery
deadlock avoidance
cache coherence
None of the above
Answer: Option
Explanation:
The Banker's algorithm is a resource allocation & deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of pre-determined maximum possible amounts of all resources, and then makes a "safe-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
Discussion:
Be the first person to comment on this question !

Post your comments here:

Your comments will be displayed after verification.