Consider the banker’s algorithm of Fig. 3-15. Assume that processes A and D change their requests to an additional (1, 2, 1, 0) and (1, 2, 1, 0) respectively. Can these requests be met and the system still remain in a safe state?

Transcribed Image Text:

Process A 3 B 0 C 1 D E 0 Tape drives 1 1 100 110 1 1 0 0 0 0 Resources assigned Plotters Printers 1 0 CD ROMS Process Tape drives Plotters Printers A B 01 C 1 1 0 0 1 2 3 1 0 0 D 0 0 1 0 E 2 1 1 0 Resources still needed CD ROMS E = (6342) P = (5322) A = (1020) Figure 3-15. The banker's algorithm with multiple resources.