Deadlock and Starvation - Operating Systems - Lecture Slides, Slides for Computer Science. All India Institute of Medical Sciences

Computer Science

Description: These are the Lecture Slides of Operating Systems which includes Sleeping Barber Problem, Waiting Customers, Chair and Sleeps, Barber Is Sleeping, New Customer Arrives, Barber Shop Hints, Customer Threads, Barber Invokes, Thread Invoking etc.Key important points are: Deadlock and Starvation, Potential Deadlock, Actual Deadlock, Deadlock, Triggered, Typically Involves, Competing, Resources, Efficient Solution, Bad News
Showing pages  1  -  2  of  12
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Embed this document:

Operating Systems Lecture 14:

Deadlock and Starvation

1 Docsity.com

Potential Deadlock

I need quad A and B

I need quad B and C

I need quad C and B

I need quad D and A

Docsity.com

Actual Deadlock

HALT until B is free

HALT until C is free

HALT until D is free

HALT until A is free

Docsity.com

Deadlock

• A set of processes is deadlocked when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set – Typically involves processes competing for the

same set of resources

• The bad news: no efficient solution

Docsity.com

Two Processes P and Q

• Two processes P and Q, each needing exclusive access to a resource A and B for a period of time

Docsity.com

Joint Progress Diagram of Deadlock

Docsity.com

Alternative logic

• Suppose that P does not need both resources at the same time so that the two processes have this form

Docsity.com

Diagram of alternative logic

Docsity.com

Resource Allocation Graphs

• Directed graph that depicts a state of the system of resources and processes

• Process == circle, Resource == square

Docsity.com

Resource Allocation Graphs

Docsity.com

11

Four Conditions for Deadlock 1. Mutual exclusion condition

– Only one process may use a resource at a time 2. Hold-and-wait condition

– A process may hold allocated resources while awaiting assignment of others

3. No preemption condition – No resource can be forcibly removed form a process holding it

4. Circular wait condition – A closed chain of processes exists, such that each process holds

at least one resource needed by the next process in the chain

Docsity.com

Cars in Intersection, again

Docsity.com

Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome