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
Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

Q. What are the three main activities of an operating system in regard to memory management? Answer: a. Keep follows of which parts of memory are currently being used and

Determine the syntax of the assembler directive EQU The following is syntax of the assembler directive EQU: EQU

1. The City of Boston needs to be about 2 acres of green space per 1,000 persons. You have been hired as the GIS expert by an independent consulting company to determine where the

Front page We need to continue or customization and documentation of our system. Currently our system boots into runlevel 5 and we need it to boot into runlevel 3. For future r

Question : a) Describe the difference between the authentication of a user account on a peer to peer network and a client server network. b) Compare an end user account with

1. How is reliability enhanced with the microkernel approach to system design?  2. In a virtual machine design where guest operating systems are independent virtual machines sup

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

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

Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to