Representation of System Model with Resource-Allocation Graph

1 / 12

# Representation of System Model with Resource-Allocation Graph - PowerPoint PPT Presentation

DEADLOCK Date- 12/3/14 By Manoj Kumar (11CS10055). Representation of System Model with Resource-Allocation Graph. A set of edges E and A set of vertices V V is partitioned into two types:

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Representation of System Model with Resource-Allocation Graph' - jerom

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### DEADLOCKDate- 12/3/14 By Manoj Kumar (11CS10055)

• A set of edges E and A set of vertices V
• V is partitioned into two types:
• P = {P1, P2, …, Pn}, the set consisting of all the processes in the system.
• R = {R1, R2, …, Rm}, the set consisting of all resource types in the system.
• request edge – directed edge P1  Rj
• assignment edge – directed edge Rj Pi

Process

• Resource Type with 4 instances
• Pirequests instance of Rj
• Pi is holding an instance of Rj

If a Resource Allocation Graph does not have a cycle

System is not in Deadlock state

• If there is a cycle

May or may not be in a deadlock state

Let Deadlocks occur, detect them and take

action.

By Structurally negating one of the four Required

conditions.

Just ignore the problem

DEALOCK DETECTION

- Allow system to enter Deadlock State

- Detection Algorithm

- Recovery Scheme

Single Instance of each Resource Type
• Maintain wait-for graph
• Nodes are processes.
• Pi Pjif Piis waiting forPj.
• Periodically invoke an algorithm that searches for a cycle in the graph. If there is cycle there exists Deadlock.
• An algorithm to detect a cycle in a graph requires an order of n2 operations, where n is the number of vertices in the graph.
Several Instances of a Resource Type
• Available: A vector of length m indicates the number of available resources of each type.
• Allocation: An n x m matrix defines the number of resources of each type currently allocated to each process.
• Request: An n x m matrix indicates the current request of each process. If Request [ij] = k, then process Pi is requesting k more instances of resource type Rj.