operating system
Process P0 ultimately needs resource R1 and R3.
Process P1 ultimately needs resource R2 and R3.
Process P2 ultimately needs resource R1 and R3.
a) (10 points) Give an allocation order for the resource needs that will result in deadlock.
b) (10 points) Draw the resource allocation graph for the order you specified above.
Homework Answers
2. Show this allocation in a graph.
Please give an explanation for the answers as well. 1. A system has three processes (P1,...
Please give an explanation for the answers as well. 1. A system has three processes (P1, P2, and P3) and three resources (R1, R2, and R3). There is one instance of RI, two instances of R2, and three instances of R3. PI holds RI and one instance of R3 and is requesting one instance from R2. P2 holds one instance of R3 and is requesting RI and one instance from R2. P3 holds two instances of R2 and one instance...
a. A system has two processes and three identical resources. Each process needs a maximum of...
a. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer. b. A system has 4 processes, P1 through P4, and 5 types of resources, R1 through R5. Existing resource vector E = (3, 2, 1, 2, 2) Current allocation matrix C = R1 R2 R3 R4 R5 P1 1 1 0 0 0 P2 0 0 1 0 0 P2 1 0 0 20 P4 0...
Given the table, suppose we have avoided circular-wait by ordering the resources in the order R1...
Given the table, suppose we have avoided circular-wait by ordering the resources in the order R1 -> R2 -> R3 -> R4 and enforcing that each process must request resources in the ascending order. Show one allocation possibility of R1-R4 to P1-P4 and the corresponding wait-for graph. If there is a deadlock, please explain why or why not? Resource No. of instances Requested Allocated R1 2 P1, P2 ? R2 1 P1, P3 ? R3 1 P3, P4 ? R4...
Answer the following question: Process p1 needs to access resources r1, r2, r3, in some order....
Answer the following question: Process p1 needs to access resources r1, r2, r3, in some order. Process p2 needs to access resources r2, r3, r4, in some order. Which of the access sequences by p1 and p2 would violate an ordered resources policy and could lead to a deadlock? P1: r1, r3, r2 P2: r2, r3, r4 P1: r1, r2, r3 P2: r2, r3, r4 P1: r2, r1, r3 P2: r3, r2, r4 P1: r3, r2, r1 P2: r3, r4,...
A system has five processes P1 through P5 and four resource types R1 through R4. There...
A system has five processes P1 through P5 and four resource types R1 through R4. There are 2 units of each resource type. Given that: P1 holds 1 unit of R1 and requests 1 unit of R4 P2 holds 1 unit of R3 and requests 1 unit of R2 P3 holds one unit of R2 and requests 1 unit of R3 P4 requests 1 unit of R4 P5 holds one unit of R3 and 1 unit of R2, and requests...
(1) Having the following sets: [2 marks] P: P1, P2, P3 R: R1, R2, R3 E:...
(1) Having the following sets: [2 marks] P: P1, P2, P3 R: R1, R2, R3 E: P1→R2, P2→R1 R1→P1, R2→P2, R3→P3 Draw the resource allocation graph of the previous system? Examine if the system deadlocked or not and list all the cycles?
Determine whether or not there is deadlock. If yes, justify clearly indication the reason. If not,...
Determine whether or not there is deadlock. If yes, justify
clearly indication the reason. If not, explain why not.
the following resource-allocation diagram mine whether or not there is a deadlock.If yes, jutify clearly indicating the r why there is no deadlock. P2 R1 R3 P1 PS R2 A P4
Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for...
Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS represents the sequence of calls init(s), wait(s), wait(s), and signal(s) by some processes in an operating system. For each of the following sequences of calls, state the value of s and the number of processes blocked after the last call in the sequence: (b) IS (c) ISSSW (d) IWWWS (e) ISWWWW Each of the following code fragments contains a bug in the...
In the code below, three processes are competing for six resources labeled A to F. a....
In the code below, three processes are competing for six resources labeled A to F. a. Determine a sequence of requests and locks that results in a deadlock among the 3 processes. You could, for example, for each process list which resources it currently has locked (Allocated) and which resource it is requesting. Hint: it might be useful to draw a resource allocation graph to help you find a deadlock. b. Modify the order of some of the get requests...
Operating System Theory and Design 04-a) Detect if the following system has a deadlock or not....
Operating System Theory and Design
04-a) Detect if the following system has a deadlock or not. Prove your answer. If it has a deadlock then terminates it without using the restart of the computer method. (3 POINTS) R1 0 P1 P2 R2
Please give an explanation for the answers as well. 1. A system has three processes (P1, P2, and P3) and three resources (R1, R2, and R3). There is one instance of RI, two instances of R2, and three instances of R3. PI holds RI and one instance of R3 and is requesting one instance from R2. P2 holds one instance of R3 and is requesting RI and one instance from R2. P3 holds two instances of R2 and one instance...
a. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer. b. A system has 4 processes, P1 through P4, and 5 types of resources, R1 through R5. Existing resource vector E = (3, 2, 1, 2, 2) Current allocation matrix C = R1 R2 R3 R4 R5 P1 1 1 0 0 0 P2 0 0 1 0 0 P2 1 0 0 20 P4 0...
Answer the following question: Process p1 needs to access resources r1, r2, r3, in some order. Process p2 needs to access resources r2, r3, r4, in some order. Which of the access sequences by p1 and p2 would violate an ordered resources policy and could lead to a deadlock? P1: r1, r3, r2 P2: r2, r3, r4 P1: r1, r2, r3 P2: r2, r3, r4 P1: r2, r1, r3 P2: r3, r2, r4 P1: r3, r2, r1 P2: r3, r4,...
Determine whether or not there is deadlock. If yes, justify
clearly indication the reason. If not, explain why not.
the following resource-allocation diagram mine whether or not there is a deadlock.If yes, jutify clearly indicating the r why there is no deadlock. P2 R1 R3 P1 PS R2 A P4
Operating System Theory and Design
04-a) Detect if the following system has a deadlock or not. Prove your answer. If it has a deadlock then terminates it without using the restart of the computer method. (3 POINTS) R1 0 P1 P2 R2
Most questions answered within 3 hours.
-
I need help with writing the conclusion for this online lab
report
Abstract
By testing the...
asked 1 minute from now -
For the reaction 1N2+3H2-----> 2NH3, would the reaction rate
trend be: delta[NH3]/ delta t = -2...
asked 34 minutes ago -
Within your current/past organization, identify a problem/issue
and format a design to address same. You may...
asked 16 minutes ago -
A sock stuck to the side of a clothes-dryer barrel has a
centripetal acceleration of 24...
asked 1 hour ago -
A perfect gas undergoes an isentropic process such that its
volume doubles. If the ratio of...
asked 1 hour ago -
list the elements in groups 3A to 6A in the same order as in the
periodic...
asked 1 hour ago -
Estimating effect size. Peng and Chen (2014)
evaluated effect size estimates for various tests. In their...
asked 2 hours ago -
Write a script in MySQL that creates and calls a stored
procedure name test. This procedure...
asked 2 hours ago -
If we test the following: H0: μ = 17
vs. H1: μ ≠ 17 and the...
asked 2 hours ago -
in the past year TVG had revenues of 3 million, cost
of goods sold of $25...
asked 2 hours ago -
4) In a polypeptide, which bond cannot rotate because of its
partial double bond character?
The...
asked 2 hours ago -
Assume that in the short run L = 1,000 and K = 100. 1. What is...
asked 2 hours ago