Banker's Algorithm Visualizer

Safety Algorithm

1. Let Work and Finish be vectors. Work = Available Finish[i] = false
2. Find an index i such that: (a) Finish[i] == false (b) Needi <= Work
3. If Condition is True: Work = Work + Allocationi Finish[i] = true
4. If Finish[i] == true for all i, then Safe.
WORK (Available): [
3
,
3
,
2
]

Proc

   

Max

ABC

Allocation

ABC

Need

ABC
🎉 SYSTEM IS SAFE! 🎉
System Ready.