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  -  4  of  12
Operating Systems
Lecture 14:
Deadlock and Starvation
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
Actual Deadlock
HALT until B
is free
HALT until C
is free
HALT until D
is free
HALT until A
is free
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
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Uploaded by: ekana
Views: 1106
Downloads : 0
University: All India Institute of Medical Sciences
Upload date: 27/03/2013
Embed this document:
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