How can deadlocks be represented?, Operating System

How can deadlocks be represented?

Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the following:

  • a set of vertices V
  • a set of edges E
  • The set of vertices V is partitioned in to dissimilar types of nodes = {p1, p2...} the set of active process in the system, and R= {r1, r2...} the set of resource in the system.

Pi      Rj indicates that process pi has requested an instance of resource type Rj and is waiting currently for the resource. This is called as the request edge.

 Rj      Pi indicates that an instance of resource Rj has been allocated to process Pi. This is called as the assignment edge.

532_How can deadlocks be represented.png

Posted Date: 6/22/2013 7:26:11 AM | Location : United States

Related Discussions:- How can deadlocks be represented?, Assignment Help, Ask Question on How can deadlocks be represented?, Get Answer, Expert's Help, How can deadlocks be represented? Discussions

Write discussion on How can deadlocks be represented?
Your posts are moderated
Related Questions
Q. Explain about Error detection method? Error detection: error can occur in CPU, in I/O devices or in memory hardware. Operating system constantly needs to be aware of possi

We will brie?y introduce paging to ?nish off this lecture. When a process is loaded, not all of the pages are immediately loaded, since it's possible that they will not all be need

Operating Systems 1. Explain single Partition Allocation and Multiple Partition Allocation. 2. What do you mean by PCB? What useful information is available in PCB? 3. De

Transparency : Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed to lo

Virtual file systems The file-system execution having of three major layers. The first layer is the file-system interface, based on the open, read, write and close calls and fi

Question : The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operatin

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

Q. The term "fast wide SCSI-II" signifies a SCSI bus that operates at a data rate of 20 megabytes per second when it moves a packet of bytes among the host and a device. Presume t