Question: Problem #4 (Deadlock 25 pts) Consider a system with five processes (P1...., 5) and five Resource Types (R1, R2, R3, R4) with: The resource allocations:

 Problem #4 (Deadlock 25 pts) Consider a system with five processes

Problem #4 (Deadlock 25 pts) Consider a system with five processes (P1...., 5) and five Resource Types (R1, R2, R3, R4) with: The resource allocations: P1(0, 0, 1,2), P2(1, 0, 0, 0), P3(1, 3, 5, 4), P4(0, 6, 3, 2) and P5(0, 0, 1,4), The maximum number of resource processes can request: P1(0, 0, 1, 2), P2(1,7, 5,0), P3(2, 3, 5, 6), P4(0, 6, 5, 2) and P5(0, 6, 5, 6), . Total number of resource in the system: (3, 14, 12, 12) . 1. Compute the matrix need (5 pts) 2. Compute the resource still available in the system (2 pts) 3. Is the system in a safe state? (10 pts)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!