Give an example of resource allocation graph & deadlocked, Computer Engineering

Assignment Help:

Suppose there are 2 copies of resource A, 3 copies of resource B, and 3 copies of resource C. Suppose further that process 1 holds one unit of resources B and C and is waiting for a unit of A; that process 2 is holding a unit of A and waiting on a unit of B; and that process 3 is holding one unit of A, two units of B, and one unit of C. Draw the resource allocation graph. Is the system in a deadlocked state? Why or why not?

Resource allocation graph is specified below:

1593_Resource allocation graph.png

Here is a cycle into the resource allocation graph shows system is not in a safe condition. System is in deadlock as needed resources are 1 unit of resource A and 1 unit of resource B whereas available resource is 1 unit of resource C. Not any of the process can be finished.


Related Discussions:- Give an example of resource allocation graph & deadlocked

SERVER, How to configure TSM server

How to configure TSM server

Transaction, Explain Shadow Copy Scheme in detail.

Explain Shadow Copy Scheme in detail.

Which electro mechanical switch had fewer moving parts, The             el...

The             electro mechanical switch (developed in 1938) had fewer moving parts than earlier switches. (A)  No. 1ESS                                 (B)  Strowger (

Explain the product of sum form - standard forms, Explain the Product of Su...

Explain the Product of Sum Form - standard forms? The POS is the Boolean Expression containing OR terms, called as sum terms. The product denotes ANDing of these terms. F= (

Explain the number unobtainable tone in strowger telephony, Explain the num...

Explain the number unobtainable tone in strowger telephony with waveforms and the timings. In the following figure illustrates the number unobtainable tone that is continuous

Dbms., what is cascade rollback

what is cascade rollback

Quick sort exhibit its worst-case behaviour, In which input data does the a...

In which input data does the algorithm quick sort exhibit its worst-case Behaviour? The Quick Sort method exhibits its worst-case behavior when the input data is " Already Comp

Multiple valued logics, Multiple valued logics: Multiple valued logics...

Multiple valued logics: Multiple valued logics, where altered types of truth value such as "unknown" are may be allowed. These have some of the particular advantages of fuzzy

Mathematical model, how to write mathematical model for circular linked lis...

how to write mathematical model for circular linked list

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd