Communiquez avec les autres et partagez vos connaissances professionnelles

Inscrivez-vous ou connectez-vous pour rejoindre votre communauté professionnelle.

Suivre

What problem is solved by Dijkstra's banker's algorithm? A. mutual exclusion B. deadlock recovery C. deadlock avoidance

user-image
Question ajoutée par Emad Mohammed said abdalla , ERP & IT Software, operation general manager . , AL DOHA Company
Date de publication: 2014/12/10
Emad Mohammed said abdalla
par Emad Mohammed said abdalla , ERP & IT Software, operation general manager . , AL DOHA Company

The answer will be  C. deadlock avoidance

 

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.

More Questions Like This