Consider a system with five processes P1, P2, P3, P4, P5 and resources R1, R2, R3,...

Transcribed Image Text:

Consider a system with five processes P1, P2, P3, P4, P5 and resources R1, R2, R3, R4, R5, R6. Also assume that there are two units of each resource type. Now consider the following status: Process P1 holds 1 unit of R1 and requests 1 unit of R4. Process P2 holds 1 unit of R1 and requests 1 unit each of R1 and R2. Process P3 holds 1 unit of each R2, R3 R4 and R5, and requests 1 unit of R1. Process P4 holds 1 unit of each R3 and R5, and requests 1 unit of R6. Process P5 holds 2 units of R6 and requests 1 unit of R3. A) Show the resource allocation graph that represents this system state. (10 points) B) Is this system deadlocked? If so, state which processes are involve. If not, give an execution sequence that eventually ends, showing resource acquisition and release at each step. (5 points) ● ● ● ● ● Consider a system with five processes P1, P2, P3, P4, P5 and resources R1, R2, R3, R4, R5, R6. Also assume that there are two units of each resource type. Now consider the following status: Process P1 holds 1 unit of R1 and requests 1 unit of R4. Process P2 holds 1 unit of R1 and requests 1 unit each of R1 and R2. Process P3 holds 1 unit of each R2, R3 R4 and R5, and requests 1 unit of R1. Process P4 holds 1 unit of each R3 and R5, and requests 1 unit of R6. Process P5 holds 2 units of R6 and requests 1 unit of R3. A) Show the resource allocation graph that represents this system state. (10 points) B) Is this system deadlocked? If so, state which processes are involve. If not, give an execution sequence that eventually ends, showing resource acquisition and release at each step. (5 points) ● ● ● ● ● Consider a system with five processes P1, P2, P3, P4, P5 and resources R1, R2, R3, R4, R5, R6. Also assume that there are two units of each resource type. Now consider the following status: Process P1 holds 1 unit of R1 and requests 1 unit of R4. Process P2 holds 1 unit of R1 and requests 1 unit each of R1 and R2. Process P3 holds 1 unit of each R2, R3 R4 and R5, and requests 1 unit of R1. Process P4 holds 1 unit of each R3 and R5, and requests 1 unit of R6. Process P5 holds 2 units of R6 and requests 1 unit of R3. A) Show the resource allocation graph that represents this system state. (10 points) B) Is this system deadlocked? If so, state which processes are involve. If not, give an execution sequence that eventually ends, showing resource acquisition and release at each step. (5 points) ● ● ● ● ●

Answer rating: 100% (QA)

A Resource Allocation Graph R1 P1 R4 R2 P2 R1 R2 R3 P3 R2 R3 R4 R5 R4 P1 R1 R5 P4 R3 R5 R6 P5 R6 B D... View the full answer