Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Active In SP

Posts: 1,124
Joined: Jun 2010
19-10-2010, 10:35 AM


Deadlock Debrief
Simplest Example
Necessary Deadlock Conditions
Resource Allocation Graph
Deadlock Handling
Deadlock and Starvation with Semaphores

Simplest example:
Two processes require two resources to complete (and release the resources)
There are only two instances of these resources
If they acquire one resource each, they block indefinitely waiting for each other to release the other resource =>
DEADLOCK, one of the biggest problems in multiprogramming.
Necessary Deadlock Conditions

Recall which conditions must hold (p. 245):
ME: at least one process exclusively uses a resource
Hold and wait: a process possesses at least one resources and requires more, which are held by others
No preemption: resources are released only in voluntary manner by processes holding them
Circular wait: P1P2  P3  …  PN  P1

Resource-Allocation Graph

An easy way to illustrate resource allocation and visually detect the deadlock situation(s)
N+1 resources
N processes
Every process needs 2 resources
Upon acquiring 2 resources, a process releases them
Is there a deadlock?

For more information about this article,please follow the link;

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)