Dijkstra's Bankers Algorithm

Posted by idea_ on Stack Overflow See other posts from Stack Overflow or by idea_
Published on 2009-11-14T17:40:00Z Indexed on 2010/04/12 13:13 UTC
Read the original article Hit count: 1128

Could somebody please provide a step-through approach to solving the following problem using the Banker's Algorithm? How do I determine whether a "safe-state" exists? What is meant when a process can "run to completion"?

In this example, I have four processes and 10 instances of the same resource.

          Resources Allocated | Resources Needed
Process A                   1                  6
Process B                   1                  5
Process C                   2                  4
Process D                   4                  7

© Stack Overflow or respective owner

Related posts about dijkstra

Related posts about algorithm