CPS 110 Deadlock Landon Cox February 4 2009

CPS 110: Deadlock Landon Cox February 4, 2009

Concurrency so far ê Mostly tried to constrain orderings ê Locks, monitors, semaphores ê It is possible to over-constrain too ê A must run before B ê B must run before A ê This can lead to deadlock

Definitions ê Resource ê Thing needed by a thread to do its job ê Threads wait for resources ê E. g. locks, disk space, memory, CPU ê Deadlock ê Circular waiting for resources ê Leaves threads unable to make progress

Example deadlock ê Both CPS 108 and CPS 110 are full ê You want to switch from 110 to 108 ê Someone else wants to switch from 108 to 110 ê Algorithm for switching ê Wait for spot in new class to open up ê Add new class ê Drop old class ê Problem: must add before dropping

Deadlock and starvation ê Deadlock starvation ê Starvation = one process waits forever Thread A Thread B lock (x) lock (y) … unlock (y) unlock (x) lock (y) lock (x) … unlock(x) unlock(y) Can deadlock occur?

Deadlock and starvation ê Deadlock starvation ê Starvation = one process waits forever Thread A Thread B lock (x) lock (y) // wait for B lock (x) // wait for A Will. Can deadlock always occur?

Common thread work pattern Phase 1. Phase 2. while (not done) { get some resources (block if necessary) work // assume finite } release all resources ê Has anyone taken CPS 116 (databases)? ê This is called “two-phase” locking ê Ensures “conflict-serializability” ê Still deadlock-prone

Dining philosophers Philosopher algorithm 1) Wait for right chopstick 2) Pick up right chopstick 3) Wait for left chopstick 4) Pick up left chopstick 5) Eat 6) Put both chopsticks down How can deadlock occur? A E B D C

Conditions for deadlock 1. Limited resource ê Not enough for all threads simultaneously 2. Hold-and-wait ê Hold one resource, while waiting for another 3. No pre-emption ê Cannot force threads to give up resources 4. Circular chain of requests

Circular chain of requests ê Arrows ê Thread resource it’s waiting for ê Resource thread that’s holding it Thread A Resource 1 Thread B acquires Resource 1 Thread B waits for Resource 2 Thread A acquires Resource 2 Thread A waits for Resource 1 Resource 2 Thread B Called a wait-for graph

Deadlock ê What should we do about them? 1. Ignore them ê Common OS-level solution for programs ê (OS has no control over user programs) 2. Detect-and-fix 3. Prevent

Detect-and-fix ê First part: detect ê This is easy; just scan the wait-for graph ê Second part: fix 1. Kill first thread, take back resources by force ê Why might this be unsafe? ê Can expose inconsistent state 2. Roll-back actions of 1 or more thread, retry ê Often used in databases ê Not always possible (some actions can’t be undone) ê E. g. can’t unsend a network message

Detect-and-fix ê Retrying during fix phase can be tricky ê If holding R and will wait for L, drop R and try again. A What could happen? Everyone picks up R E Everyone drops R Everyone picks up R Everyone drops R (and so on) This is called “livelock. ” B D C

Detect-and-fix ê Retrying during fix phase can be tricky ê If holding R and will wait for L, drop R and try again. How to prevent livelock? Choose a winner. How to choose a winner? E First to start/pick up? What if we have priorities? (called “priority inversion”) e. g. Queen waiting for joker Should Queen always win? No, could starve the joker A B D C

Deadlock prevention ê Idea: remove one of four preconditions 1. Make resources unlimited ê Best solution, but often impossible ê Can still increase number, reduce likelihood ê (larger 108 and 110 classes) ê Not clear this works for locks

Deadlock prevention 2. Eliminate hold-and-wait ê Idea: move resource acquisition to beginning Phase 1 a. get all resources Phase 1 b. while (not done) { work // assume finite } Phase 2. release all resources ê Two ways to avoid holding while waiting

Eliminating hold-and-wait 1. Wait for everything to be free, then grab them all at Philosopher algorithm once lock while (left chopstick busy || right chopstick busy) { wait } pick up right chopstick pick up left chopstick unlock eat lock drop chopsticks unlock Any potential problems? Can induce starvation (neighbors alternate eating).

Eliminating hold-and-wait 2. If you find a resource busy, drop everything, and try Philosopher algorithm again lock while (1) { while (right chopstick busy) { wait } pick up right chopstick if (left chopstick busy) { drop right chopstick } else { pick up left chopstick break } } unlock eat lock drop chopsticks unlock Issues? Must predict what you need in advance. Hold reservations longer than needed Requires changes to applications.

Deadlock prevention 3. Enable pre-emption ê Can pre-empt the CPU (context switch) ê Can pre-empt memory (swap to disk) ê Not everything can be pre-empted ê Can locks be pre-empted? ê Probably not ê Must ensure that data is in consistent state

Deadlock prevention 4. Eliminate circular chain of requests ê How can we get rid of these cycles? ê Impose an ordering on resource acquisition ê E. g. must always acquire A before B ê In dining philosophers? ê Number chopsticks ê Pick up lower-numbered chopstick first

Dining philosophers Philosopher algorithm 1) Wait for lower chopstick 2) Pick up lower chopstick 3) Wait for higher chopstick 4) Pick up higher chopstick 5) Eat 6) Put both chopsticks down A 1 2 E B 5 Try to create a deadlock 3 D 4 C

Universal ordering ê Why does this work? ê At some point in time ê T holds highest-numbered acquired resource ê T is guaranteed to make progress. Why? ê If T needs a higher-numbered resource, it must be free ê If T needs a lower-numbered resource, it already has it ê If T can make progress, it will eventually release all of its resources ê What if another thread acquires a higher-numbered resource? ê They just become T ê (in which case, the same reasoning as above holds)

Dining philosophers Philosopher algorithm 1) Wait for lower chopstick 2) Pick up lower chopstick 3) Wait for higher chopstick 4) Pick up higher chopstick 5) Eat 6) Put both chopsticks down A 1 2 E B 5 What if E only needs one chopstick? Only have trouble if E acquires lowernumbered chopstick before 5. (but this is a violation of our rule) 3 D 4 C

Deadlock avoidance ê Issue with imposing global orderings ê Must change the application ê Common technique ê Requires programming discipline

Course administration ê Project 1 ê Due February 18 th (two weeks) ê 6 groups are done with 1 d ê No one has submitted 1 t yet (!) ê Should be done with 1 d by end of the week ê 1 t is a lot more work, don’t keep putting it off! ê Compiling ê g++ -o disk. cc thread. o

Course administration ê Remember to work on your thread library test suite too ê For each of your test cases ê Compare output of your library with thread. o ê Writing test cases ê Read through spec ê Write test cases to stress each required part ê E. g. lock() blocks if lock is already held ê Use yield() to create the right interleavings ê Read through your code ê Write test cases to exercise all lines of code ê E. g. each clause of an if/else statement ê Micro-tests are better for debugging than macro-tests

Banker’s algorithm ê Like acquiring all resources first ê (but more efficient) Phase 1 a. state max resources needed Phase 1 b. while (not done) { get some resources (blocking if not SAFE) work // assume finite } Phase 2. release all resources

Comparing banker’s algorithm ê Original ê Acquired resources if available (deadlock) ê Previous solution (no “hold-and-wait”) ê Acquired all resources or none ê Must acquire max resources to do work ê All threads doing work own their max ê Thus, all threads doing work can complete

Banker’s algorithm ê Give out resources at request time (1 b) ê Request granted if it is safe ê Can grant max requests of all threads in some sequential order ê Sequential order ê One thread gets its max resources, finishes, and releases its Phaseresources 1 a. state max resources needed Phase 1 b. while (not ê Another thread getsdone) its max{resources, finishes, and releases, get some resources (blocking if not SAFE) etc work Phase 2. // assume finite } release all resources

Example ê Bank ê Has $6000 to loan ê Customers ê Establish credit limits (max resources) ê Borrow money (up to their limit) ê Return all money at the end

Example: Solution 1 ê Bank gives money on request, if available ê For example ê Ann asks for credit line of $2000 ê Bob asks for credit line of $4000 ê Cat asks for credit line of $6000 ê Can bank approve each of these lines? ê (assuming it gives money, if available)

Example: Solution 1 ê No. Consider: ê Ann takes out $1000 (bank has $5000) ê Bob takes out $2000 (bank has $3000) ê Cat takes out $3000 (bank is empty) ê Bank has no money ê Ann, Bob, and Cat could all ask for $ ê None would be able to finish (deadlock)

Example: Solution 1 ê This only works if we wait to approve credit lines ê For example ê Ann asks for credit line of $2000 ê Bank approves ê Bob asks for credit line of $4000 ê Bank approves ê Cat asks for credit line of $6000 ê Bank must make Cat wait until Ann or Bob finish ê Sum of all max resource needs of all current threads ê Must not exceed the total resources

Example: Solution 2 ê Bank says ok to all credit line requests ê Customers may wait for resources ê Bank ensures no deadlocks ê For example ê Ann asks for credit limit of $2000 ê Bob asks for credit limit of $4000 ê Cat asks for credit limit of $6000 ê Bank approves all credit limits

Example: Solution 2 ê Ann takes out $1000 (bank has $5000) ê Bob takes out $2000 (bank has $3000) ê Cat wants to take out $2000 ê Is this allowed? ê Bank would be left with $1000 ê Ann would still be guaranteed to finish ê (could take out another $1000) ê On finish, bank would have $2 k ê This is enough to ensure that Bob can finish

Example: Solution 2 ê Ann takes out $1000 (bank has $5000) ê Bob takes out $2000 (bank has $3000) ê Cat wants to take out $2500 ê Is this allowed? ê Bank would be left with $500 ê Can’t guarantee that any threads will finish

Banker’s algorithm ê Allows resources to be overcommitted ê How can we apply this to dining philosophers? ê Put all chopsticks in the middle of the table ê Max resource need for each philosopher is 2 ê Grant requests, unless ê There is only one chopstick left and nobody has 2 ê Nice algorithm, but few people use it. Why? ê You rarely know what you’ll need in advance ê Doesn’t really make sense for locks (no “generic lock”)