Deadlock avoidance algorithm - bankers algorithm

Q.  Which of the following is deadlock avoidance algorithm?
- Published on 23 Jun 15

a. round-robin algorithm
b. banker's algorithm
c. Multilevel feedback
d. None of the above.

ANSWER: banker's algorithm

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 25 Nov 15
    Banker's algorithm
    - It is sometimes referred to as the avoidance algorithm and is a resource allocation and deadlock avoidance algorithm.

    - It was developed by Edsger Dijkstra.

    - This algorithm tests for the safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes an "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

    - This algorithm was developed in the design process for the THE operating system and originally described (in Dutch) in EWD108.

    - Whenever a new process enters a system, declaration of the maximum number of instances of each resource type that it may ever claim; clearly, that number may not exceed the total number of resources in the system.

    - When a process gets all its requested resources it must return them in a fixed amount of time.

➨ Post your comment / Share knowledge


Enter the code shown above:
 
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲