{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ch6 - Chapter 6 Deadlock Concurrency Deadlock 1...

Info icon This preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Concurrency: Deadlock 1 ©Magee/Kramer 2 nd Edition Chapter 6 Deadlock
Image of page 1

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

View Full Document Right Arrow Icon
Concurrency: Deadlock 2 ©Magee/Kramer 2 nd Edition Deadlock Concepts : system deadlock : no further progress four necessary & sufficient conditions Models : deadlock - no eligible actions Practice : blocked threads Aim : deadlock avoidance - to design systems where deadlock cannot occur.
Image of page 2
Concurrency: Deadlock 3 ©Magee/Kramer 2 nd Edition Deadlock: four necessary and sufficient conditions Serially reusable resources: the processes involved share resources which they use under mutual exclusion. Incremental acquisition: processes hold on to resources already allocated to them while waiting to acquire additional resources. No pre-emption: once acquired by a process, resources cannot be pre-empted (forcibly withdrawn) but are only released voluntarily. Wait-for cycle: a circular chain (or cycle) of processes exists such that each process holds a resource which its successor in the cycle is waiting to acquire.
Image of page 3

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

View Full Document Right Arrow Icon
Concurrency: Deadlock 4 ©Magee/Kramer 2 nd Edition Wait-for cycle A B C D E Has A awaits B Has B awaits C Has C awaits D Has D awaits E Has E awaits A
Image of page 4