Question: QUESTION 2 Given the following state for the Bankers Algorithm. 6 processes P0 through P5 4 resource types: A (15 instances); B (6 instances); C
QUESTION 2
Given the following state for the Bankers Algorithm.
6 processes P0 through P5
4 resource types: A (15 instances); B (6 instances); C (9 instances); D (10 instances)
Snapshot at time T0:
A B C D
| 6 | 3 | 5 | 4 |
c. Show that the current state is safe, that is, show a safe sequence of processes. In addition to the sequence show how the Available (working array) changes as each process terminates.
Choose from processes that could run to completion in this order: P0, P1, P2, ...P5 in a round-robin fashion....
Safe sequence: <
|
|
|
|
|
|
|
|
| A | B | C | D |
| Available when 1st process finishes |
|
|
|
|
|
|
|
|
|
|
| Available when 2nd process finishes |
|
|
|
|
|
|
|
|
|
|
| Available when 3rd process ] finishes |
|
|
|
|
|
|
|
|
|
|
| Available when 4th process finishes |
|
|
|
|
|
|
|
|
|
|
| Available when 5th process finishes |
|
|
|
|
|
|
|
|
|
|
| Available when 6th process finishes |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help