Deadlocks: detection, prevention, avoidance
Operating Systems · Engineering
Study notes
Banker's algorithm: 3 processes, resources A(10): allocated [3,3,2], max [7,5,6], available 2. P1 needs 2 more: grant (available 0), P1 finishes, releases 5, available 5. P0 needs 4: grant, finishes, releases 7... safe sequence <P1,P0,P2> exists, so grant. Without a safe sequence, the banker waits.