Home » Computer Science » Operating Systems Concepts

What problem is solved by Dijkstra's banker's algorithm?

Correct Answer: deadlock avoidance

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.

← Previous Question Next Question→

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion