185
banker’s algorithm: comments
nA safe state cannot be deadlocked. But an unsafe state is not necessarily deadlocked.
uEx:  P1 from the previous (unsafe) state could release temporarily a unit of R1 and R3 (returning to a safe state)
usome process may need to wait unnecessarily
usub optimal use of resources
nAll deadlock avoidance algorithms assume that processes are independent: free from any synchronization constraint