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

what is polymorphism in c++, Polymorphism in C++ is the idea that a base c...

Polymorphism in C++ is the idea that a base class can be inherited by various classes. A base class pointer can point to its child class and a base class array can store dissimilar

Career after BSc CS, Sir,wish to receive guidance from you how to join in A...

Sir,wish to receive guidance from you how to join in Aeronautical Engineering after Bsc Computer Science. I am a Girl.Interested to work in AE field, it will be better to use in co

Ifstream on the input file, Write a main function that opens an ifstream on...

Write a main function that opens an ifstream on the input file, "person.dat".  If the stream cannot be  opened, output an error message and exit.       The file format is as foll

How to copy files from a drive and directory, Q. How to copy files from a d...

Q. How to copy files from a drive and directory? You can copy files from a drive and directory other that the currently selected one. However in that case, you need to speci

Implement that function using only nand gates, Q. Find simplified function ...

Q. Find simplified function F and implement that function using only NAND gates. 1.  F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2.  F (A,B,C,D) = A'B'C'+B'CD'+A'BCD'+AB'C' 3.

Illustrates about metal fix, Illustrates about Metal Fix. A Metal Fix i...

Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde

Write a menu driven program to perform addition, Q. Write a menu driven pr...

Q. Write a menu driven program to perform addition and subtraction in base 5. Check that entered numbers are in base 5 or not else error message should be displayed.

What is meant by inferring latches, What is meant by inferring latches, how...

What is meant by inferring latches, how to avoid it? Consider the following: always @(s1 or s0 or i0 or i1 or i2 or i3) case ({s1, s0}) 2'd0: out = i0; 2'd1: out =

Give difference between assembler and interpreter, Give difference between ...

Give difference between assembler and interpreter. Assembler: It is the translator for an assembly language of computer. An assembly language is a low-level programming langu

De morgan''s laws - artificial intelligence, De Morgan's Laws Continuin...

De Morgan's Laws Continuing with the relationship between  ∧  and  ∨ , we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these conne

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