Banker's Algorithm

Operating Systems

5X1 Look at the Bankers-Algorithm slides (posted on D2L) (also in class video) Given the following snapshot of the system and assuming that the system is currently in a safe state; for each of the 3 requests A,B,C; state if the request should (raise an error, be made to wait, be granted) Each request should be considered independently of the others. That means each should be evaluated against the starting state of the system You should use the Banker's algorithm to determine the course of action Allocation Max Available A B C PO 0 0 Pl 2 0 0 P2 3 0 2 P3 21 1 P4 0 1 2 A B C ABC valuate each request separately against this starting state Request 1 P ,1,1) then start over for Request 2 P2 (4,0,0) then start over for Request 3 P3 (0,3,0) ABC P1 P3 4 PO 1 P2 P4 12 2 0 0 Max - Allocation Need P1 P2 P3 4 0 Available 0 Allocation