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

Calculate number of calls put through by a single server, A group of 20 ser...

A group of 20 servers carry traffic of 10 erlangs. If the average duration of a call is three minutes, calculate the number of calls put through by a single server and the group as

What is capacitor-based keyboards, Q. What is Capacitor-Based Keyboards? ...

Q. What is Capacitor-Based Keyboards? These keyboards are based on the idea of Capacitance. A simple capacitor comprises a pair of conductive plates having opposite charges and

How can we convert infix expression to a postfix expression, One can change...

One can change an infix expression to a postfix expression using a By using Stack you can convert infix expression to a postfix expression

Explain the linux from scratch system, Problem 1 (a) Explain the RAID ...

Problem 1 (a) Explain the RAID system and explain all possible configurations. (b) Summarize design goals, features and specifications of the Linux ext2 file system. (c

Explain various steps for analysing an algorithm, Explain various steps for...

Explain various steps for analysing an algorithm.  The several steps involved in analysis of an algorithm are: 1. For any algorithm, the first step should be to show that it

What is disk access time, Q. What is disk access time? The disk access ...

Q. What is disk access time? The disk access time has two key components: Seek Time: Seek time is the time for disk arm to move heads to the cylinder comprising the desi

Software, its language base assignment

its language base assignment

Tools for performance measurement, Tools for Performance Measurement Th...

Tools for Performance Measurement The reason behind these algorithms has been to gain a speed up and improve the performance. After the parallel algorithm has been written and

The alignment of a type ''c'' field in a report, The alignment of a type 'c...

The alignment of a type 'c' field in a report is? ? Left Aligned.

Extract data from tables without using the event ''get'', Is it possible to...

Is it possible to extract data from tables without using the event 'GET' in the report with an appropriate LDB. False.   You can extract data from tables using Select stateme

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