HomeworkLib
Question

Construct a general resource graph for the following scenario and determine if the graph is completely...

Construct a general resource graph for the following scenario and determine if the graph is completely reducible: R1, R2, and R3 are reusable resources with a total of two, two, and three units. Process P1 is allocated one unit each of R2 and R3 and is requesting one unit of R1. Process P2 is allocated one unit of R1 and is requesting two units of R3. Process P3 is allocated one unit each of R1 and R2 and is requesting one unit of R3.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Resource graph for the given scenario:

To reduce the graph, unblocked process is selected and all request and allocation edges are removed.

In this given graph process P2 is unblocked, as it requires only two units of resource R3 which is available. Thus process P2 is selected for removal.

The resultant graph after removal of process P2 is:

Process P1 is selected which is unblocked, as it request one unit of resource R1 which is available. Hence it is removed and all its request and available edges are removed.

The last process remaining is P3 which can be unblocked as it requires one unit of resource R3 which is

available. Hence this process can also be completed. Hence the graph is completely reducible.

0 0
Add a comment
Know the answer?
Add Answer to:
Construct a general resource graph for the following scenario and determine if the graph is completely...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 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...

  • 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...

  • 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...

  • Assume a system with 3 processes P1, P2, and P3, and resources R1, R2, and R3....

    Assume a system with 3 processes P1, P2, and P3, and resources R1, R2, and R3. Each resource has a single instance. Draw a resource allocation graph for the following sequence of events: P1 is granted access to resource R1. P2 requests resource R1 P3 requests resource R3 P2 is granted access toR2 P1 requests R2 Convert your resource allocation graph to a wait-for graph. Is there a deadlock?

  • (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?

  • 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...

  • Consider the following snapshot of a system: Allocation P R1 R2 R3 R4 P1 0 0...

    Consider the following snapshot of a system: Allocation P R1 R2 R3 R4 P1 0 0 1 2 P2 1 0 0 0 P3 1 3 5 4 P4 0 6 3 2 P5 0 0 1 4 P represents processes R represents resources Need P R1 R2 R3 R4 P1 0 0 1 2 P2 1 7 5 0 P3 2 3 5 6 P4 0 6 5 2 P5 0 6 5 6 P represents processes R represents...

  • operating system

    Consider the following three concurrent processes and resource requirements: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.

  • T/F question about operating system, thank you 1. A deadlocked system must involve at least two...

    T/F question about operating system, thank you 1. A deadlocked system must involve at least two threads/processes that are deadlocked. 2. If all 4 following conditions hold in a system: mutual exclusion, hold and wait, circular waiting, and no pre-emption, then a deadlock must occur. 3. In avoidance strategy, the OS may refuse to allocate requested resources if there is a potential for a deadlock. 4. Given a reusable resource graph representing a state S, state S is a deadlock...

  • 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...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT