CS3224 - 7. Deadlocks (three per page)

CS3224 - 7. Deadlocks (three per page) - Deadlocks What are...

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

View Full Document Right Arrow Icon
1 Deadlocks What are Deadlocks? How do they occur? How do we deal with them? What is a Deadlock? Formal definition : A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause Usually the event is release of a currently held resource None of the processes can … – run release resources be awakened Resources Examples of computer resources – printers – tape drives – tables, lists… Processes need access to resources in reasonable order Suppose a process holds resource A and requests resource B – at same time another process holds B and requests A – both are blocked
Image of page 1

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

View Full Document Right Arrow Icon