lecture14-chapter06 - time so that the two processes have...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Operating Systems Operating Systems Lecture 14: Lecture 14: Deadlock and Starvation Deadlock and Starvation Anda Iamnitchi [email protected] 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Potential Deadlock 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
Background image of page 2
Actual Deadlock Actual Deadlock HALT until B is free HALT until C is free HALT until D is free HALT until A is free
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Deadlock 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
Background image of page 4
Two Processes P and Q 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
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Joint Progress Joint Progress Diagram of Deadlock Diagram of Deadlock
Background image of page 6
Alternative logic Alternative logic Suppose that P does not need both resources at the same
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: time so that the two processes have this form Diagram of Diagram of alternative logic alternative logic Resource Allocation Resource Allocation Graphs Graphs • Directed graph that depicts a state of the system of resources and processes • Process == circle, Resource == square Resource Allocation Graphs Resource Allocation Graphs 11 Four Conditions for Four Conditions for Deadlock Deadlock 1. Mutual exclusion condition – Only one process may use a resource at a time 1. Hold-and-wait condition – A process may hold allocated resources while awaiting assignment of others 1. No preemption condition – No resource can be forcibly removed form a process holding it 1. 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 Cars in Intersection, again Cars in Intersection, again...
View Full Document

This note was uploaded on 02/18/2012 for the course COP 4600 taught by Professor Andaiamnitchi during the Fall '08 term at University of South Florida.

Page1 / 12

lecture14-chapter06 - time so that the two processes have...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online