next up previous
Next: The Dining Trumpet players Up: Deadlock Avoidance Previous: Dijkstra's Bankers Algorithm

Bankers Algorithm

+ : No deadlock and not as restrictive as deadlock prevention
- : Fixed number of resources and users
Guarantees finite time - NOT - reasonable response time
Needs advanced knowledge of maximum needs
Not suitable for multi-access systems
Unnecessary delays in avoiding unsafe states which may not lead to deadlock

Figure 2: Bankers algorithm (safe/unsafe states)

Therefore, from Bankers algorithm :
Allow a thread (process) to proceed if :

(total available resources) - (number allocated)
tex2html_wrap_inline246 (maximum remaining that might be needed by the thread (process))

Omer F Rana
Sat Feb 15 21:34:55 GMT 1997