CONTINUOUS DEADLOCK DETECTION: number of resources of each type currently allocated to the processes, and the current request four processes. At time 0, the following data is collected. The table indicates the process, the Suppose that there are two resource types (R, and R₂) with five resources each available to of each resource type by each process. Allocation Allocation Request Request Process R₁ Po 2 R₂ 0 R₁ R2 2 3 P₁ 0 1 1 1 P2 1 P3 0 1 1 1 2 3 a) Draw a resource allocation graph to show the above processes and resources. b) Identify any processes that are blocked: (you may want to mark them on your graph) b why is the system able to resolve the problems? c) Use deadlock detection to tell if the system is deadlocked. If so, why is it deadlocked? If not, se gminisms 2. DYNAMIC DEADLOCK DETECTION (Banker's Algorithm): 3 units. The resource allocation graph is represented by the following tables. Three processes, pl, p2, and p3, share two resources, rl and r2. Initially, rl has 1 unit and r2 has Process Maximum Current Current Potential Allocations Requests Requests (d Claims R₁ P₁ R2 R₁ R₂ R₁ R₁ R1 R₁ aboo do (b 1 3 0 1 0 1 1 2 P2 1 1 0 0 1 0 1031 Pa 1 2 0 1 0 1 1 1 a) Can the request of pl be granted? If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted. b) Can the request of pl be granted? If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted.
CONTINUOUS DEADLOCK DETECTION: number of resources of each type currently allocated to the processes, and the current request four processes. At time 0, the following data is collected. The table indicates the process, the Suppose that there are two resource types (R, and R₂) with five resources each available to of each resource type by each process. Allocation Allocation Request Request Process R₁ Po 2 R₂ 0 R₁ R2 2 3 P₁ 0 1 1 1 P2 1 P3 0 1 1 1 2 3 a) Draw a resource allocation graph to show the above processes and resources. b) Identify any processes that are blocked: (you may want to mark them on your graph) b why is the system able to resolve the problems? c) Use deadlock detection to tell if the system is deadlocked. If so, why is it deadlocked? If not, se gminisms 2. DYNAMIC DEADLOCK DETECTION (Banker's Algorithm): 3 units. The resource allocation graph is represented by the following tables. Three processes, pl, p2, and p3, share two resources, rl and r2. Initially, rl has 1 unit and r2 has Process Maximum Current Current Potential Allocations Requests Requests (d Claims R₁ P₁ R2 R₁ R₂ R₁ R₁ R1 R₁ aboo do (b 1 3 0 1 0 1 1 2 P2 1 1 0 0 1 0 1031 Pa 1 2 0 1 0 1 1 1 a) Can the request of pl be granted? If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted. b) Can the request of pl be granted? If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted.
Chapter8: Working With Advanced Functions
Section: Chapter Questions
Problem 4.4CP
Related questions
Question
Transcribed Image Text:CONTINUOUS DEADLOCK DETECTION:
number of resources of each type currently allocated to the processes, and the current request
four processes. At time 0, the following data is collected. The table indicates the process, the
Suppose that there are two resource types (R, and R₂) with five resources each available to
of each resource type by each process.
Allocation Allocation Request Request
Process
R₁
Po
2
R₂
0
R₁
R2
2
3
P₁
0
1
1
1
P2
1
P3
0
1
1
1
2
3
a) Draw a resource allocation graph to show the above processes and resources.
b) Identify any processes that are blocked:
(you may want to mark them on your graph)
b
why is the system able to resolve the problems?
c) Use deadlock detection to tell if the system is deadlocked. If so, why is it deadlocked? If not,
se gminisms
2. DYNAMIC DEADLOCK DETECTION (Banker's Algorithm):
3 units. The resource allocation graph is represented by the following tables.
Three processes, pl, p2, and p3, share two resources, rl and r2. Initially, rl has 1 unit and r2 has
Process Maximum Current
Current Potential
Allocations Requests Requests
(d
Claims
R₁
P₁
R2 R₁
R₂
R₁ R₁
R1
R₁
aboo
do (b
1
3
0
1
0
1
1 2
P2
1
1
0
0
1
0
1031
Pa
1
2
0
1
0 1
1
1
a)
Can the request of pl be granted?
If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then
select the processes that remain blocked when the request is tentatively granted.
b)
Can the request of pl be granted?
If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then
select the processes that remain blocked when the request is tentatively granted.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning