1. What problem is solved by Dijkstra's banker's algorithm?
Ask Your Doubts Here
Comments
By: guest on 01 Jun 2017 10.55 pm
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.