DOC PREVIEW
Berkeley COMPSCI 162 - Deadlock Thread Scheduling

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Page 1 CS162 Operating Systems and Systems Programming Lecture 10 Deadlock (cont’d) Thread Scheduling February 18, 2010 Ion Stoica http://inst.eecs.berkeley.edu/~cs162 Lec 10.2 2/18/10 CS162 ©UCB Fall 2010 Review: Deadlock • Starvation vs. Deadlock – Starvation: thread waits indefinitely – Deadlock: circular waiting for resources – Deadlock⇒Starvation, but not other way around • Four conditions for deadlocks – Mutual exclusion » Only one thread at a time can use a resource – Hold and wait » Thread holding at least one resource is waiting to acquire additional resources held by other threads – No preemption » Resources are released only voluntarily by the threads – Circular wait » There exists a set {T1, …, Tn} of threads with a cyclic waiting pattern Lec 10.3 2/18/10 CS162 ©UCB Fall 2010 Review: Resource Allocation Graph Examples T1 T2 T3 R1 R2 R3 R4 Simple Resource Allocation Graph T1 T2 T3 R1 R2 R3 R4 Allocation Graph With Deadlock T1 T2 T3 R2 R1 T4 Allocation Graph With Cycle, but No Deadlock • Recall: – request edge – directed edge T1 → Rj – assignment edge – directed edge Rj → Ti Lec 10.4 2/18/10 CS162 ©UCB Fall 2010 Review: Methods for Handling Deadlocks • Allow system to enter deadlock and then recover – Requires deadlock detection algorithm – Some technique for selectively preempting resources and/or terminating tasks • Ensure that system will never enter a deadlock – Need to monitor all lock acquisitions – Selectively deny those that might lead to deadlock • Ignore the problem and pretend that deadlocks never occur in the system – used by most operating systems, including UNIXPage 2 Lec 10.5 2/18/10 CS162 ©UCB Fall 2010 Goals for Today • Preventing Deadlock • Scheduling Policy goals • Policy Options • Implementation Considerations Note: Some slides and/or pictures in the following are adapted from slides ©2005 Silberschatz, Galvin, and Gagne Note: Some slides and/or pictures in the following are adapted from slides ©2005 Silberschatz, Galvin, and Gagne. Many slides generated from my lecture notes by Kubiatowicz. Lec 10.6 2/18/10 CS162 ©UCB Fall 2010 T1 T2 T3 R2 R1 T4 Deadlock Detection Algorithm • Only one of each type of resource ⇒ look for loops • More General Deadlock Detection Algorithm – Let [X] represent an m-ary vector of non-negative integers (quantities of resources of each type): [FreeResources]: Current free resources each type [RequestX]: Current requests from thread X [AllocX]: Current resources held by thread X – See if tasks can eventually terminate on their own [Avail] = [FreeResources] Add all nodes to UNFINISHED do { done = true Foreach node in UNFINISHED { if ([Requestnode] <= [Avail]) { remove node from UNFINISHED [Avail] = [Avail] + [Allocnode] done = false } } } until(done) – Nodes left in UNFINISHED ⇒ deadlocked Lec 10.7 2/18/10 CS162 ©UCB Fall 2010 Deadlock Detection Algorithm Example T1 T2 T3 R2 R1 T4 [Available] = [0,0] [RequestT2] = [0,0] [RequestT2] <= [Available] T1 T2 T3 R2 R1 T4 [Available] = [1,0] [RequestT1] = [1,0] [RequestT1] <= [Available] T1 T2 T3 R2 R1 T4 [Available] = [1,1] [RequestT3] = [0,1] [RequestT3] <= [Available] … Lec 10.8 2/18/10 CS162 ©UCB Fall 2010 What to do when detect deadlock? • Terminate thread, force it to give up resources – In Bridge example, Godzilla picks up a car, hurls it into the river. Deadlock solved! – Shoot a dining philosopher – But, not always possible – killing a thread holding a mutex leaves world inconsistent • Preempt resources without killing off thread – Take away resources from thread temporarily – Doesn’t always fit with semantics of computation • Roll back actions of deadlocked threads – Hit the rewind button on TiVo, pretend last few minutes never happened – For bridge example, make one car roll backwards (may require others behind him) – Common technique in databases (transactions) – Of course, if you restart in exactly the same way, may reenter deadlock once againPage 3 Lec 10.9 2/18/10 CS162 ©UCB Fall 2010 Techniques for Preventing Deadlock • Infinite resources – Include enough resources so that no one ever runs out of resources. Doesn’t have to be infinite, just large – Give illusion of infinite resources (e.g. virtual memory) – Examples: » Bay bridge with 12,000 lanes. Never wait! » Infinite disk space (not realistic yet?) • No Sharing of resources (totally independent threads) – Not very realistic • Don’t allow waiting – How the phone company avoids deadlock » Call to your Mom in Toledo, works its way through the phone lines, but if blocked get busy signal. – Technique used in Ethernet/some multiprocessor nets » Everyone speaks at once. On collision, back off and retry Lec 10.10 2/18/10 CS162 ©UCB Fall 2010 Techniques for Preventing Deadlock (con’t) • Make all threads request everything they’ll need at the beginning. – Problem: Predicting future is hard, tend to over-estimate resources – Example: » If need 2 chopsticks, request both at same time » Don’t leave home until we know no one is using any intersection between here and where you want to go; only one car on the Bay Bridge at a time • Force all threads to request resources in a particular order preventing any cyclic use of resources – Thus, preventing deadlock – Example (x.P, y.P, z.P,…) » Make tasks request disk, then memory, then… » Keep from deadlock on freeways around SF by requiring everyone to go clockwise Lec 10.11 2/18/10 CS162 ©UCB Fall 2010 Review: Train Example (Wormhole-Routed Network) • Circular dependency (Deadlock!) – Each train wants to turn right – Blocked by other trains – Similar problem to multiprocessor networks • Fix? Imagine grid extends in all four directions – Force ordering of channels (tracks) » Protocol: Always go east-west first, then north-south – Called “dimension ordering” (X then Y) Disallowed By Rule Lec 10.12 2/18/10 CS162 ©UCB Fall 2010 • Toward right idea: – State maximum resource needs in advance – Allow particular thread to proceed if: (available resources


View Full Document

Berkeley COMPSCI 162 - Deadlock Thread Scheduling

Documents in this Course
Lecture 1

Lecture 1

12 pages

Nachos

Nachos

41 pages

Security

Security

39 pages

Load more
Download Deadlock Thread Scheduling
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Deadlock Thread Scheduling and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Deadlock Thread Scheduling 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?