Consider the following maximum-claim reusable resource system with four processes (PO, P1, P2, P3) and three resource types (RO, R1, R2). The maximum claim matrix C is given by: R1 R2 PO 1 4 P1 3 1 4 P2 5 6 13 P3 1 1 6 where Cij denotes the maximum claim of process i for resource j. The total number of units of each resource type is given by the vector R1 8 15 The current allocation of resources is given by the matrix A RO 5 PO P1 P2 P3 RO 0 2 1 1 RO 4 R1 1 0 4 0 R2 R2 4 3 1 3 Answer the following questions about the system (you do not need to draw any graphs): 2) For the system state shown above, determine if a new request by process P2 for 6 units of resource R2 can be safely granted. (Remark: You can assume that the system state above does not yet take into account this request.). Explain your reasoning. If the request cannot be safely granted, how should the system behave with respect to the request?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider the following maximum-claim reusable resource system with
four processes (PO, P1, P2, P3) and three resource types (RO, R1, R2).
The maximum claim matrix C is given by:
RO
PO
4
P1
3
P2
5
6
P3
1
1
where Cij denotes the maximum claim of process i for resource j.
The total number of units of each resource type is given by the vector
R2
15
The current allocation of resources is given by the matrix A
RO
5
PO
P1
P2
P3
RO
0
2
1
1
R1
8
R1
1
1
R1
1
0
4
0
R2
4
4
13
6
R2
4
3
1
3
Answer the following questions about the system (you do not need to draw any
graphs):
2) For the system state shown above, determine if a new request by
process P2 for 6 units of resource R2 can be safely granted. (Remark:
You can assume that the system state above does not yet take into
account this request.). Explain your reasoning. If the request cannot |
be safely granted, how should the system behave with respect to the
request?
Transcribed Image Text:Consider the following maximum-claim reusable resource system with four processes (PO, P1, P2, P3) and three resource types (RO, R1, R2). The maximum claim matrix C is given by: RO PO 4 P1 3 P2 5 6 P3 1 1 where Cij denotes the maximum claim of process i for resource j. The total number of units of each resource type is given by the vector R2 15 The current allocation of resources is given by the matrix A RO 5 PO P1 P2 P3 RO 0 2 1 1 R1 8 R1 1 1 R1 1 0 4 0 R2 4 4 13 6 R2 4 3 1 3 Answer the following questions about the system (you do not need to draw any graphs): 2) For the system state shown above, determine if a new request by process P2 for 6 units of resource R2 can be safely granted. (Remark: You can assume that the system state above does not yet take into account this request.). Explain your reasoning. If the request cannot | be safely granted, how should the system behave with respect to the request?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY