There are four threads in the following program, labelled T to T4, which are (amongst other...

 

Transcribed Image Text:

There are four threads in the following program, labelled T to T4, which are (amongst other oper- ations) locking and unlocking three mutexes labelled A, B, and C. The order of locking is shown below: T lock(A), lock (B), lock (C), unlock (A), unlock (B), unlock (C) T2: lock(A), lock (B), lock (C), unlock (C), unlock (B), unlock (A) T3: lock(B), lock (C), unlock (B), unlock (C) T lock(C), lock (A), unlock (A), unlock (C) 1. Which threads have the potential to deadlock here? Show two possible interleavings of instructions that cause at least two threads to go into a deadlock. 2. Draw your interleavings from the above as a resource dependency graph. Verify that the deadlock exists by highlighting the cycle. Activate Wir There are four threads in the following program, labelled T to T4, which are (amongst other oper- ations) locking and unlocking three mutexes labelled A, B, and C. The order of locking is shown below: T lock(A), lock (B), lock (C), unlock (A), unlock (B), unlock (C) T2: lock(A), lock (B), lock (C), unlock (C), unlock (B), unlock (A) T3: lock(B), lock (C), unlock (B), unlock (C) T lock(C), lock (A), unlock (A), unlock (C) 1. Which threads have the potential to deadlock here? Show two possible interleavings of instructions that cause at least two threads to go into a deadlock. 2. Draw your interleavings from the above as a resource dependency graph. Verify that the deadlock exists by highlighting the cycle. Activate Wir