A newer version of this document is available. Customers should click here to go to the newest version.
Visible to Intel only — GUID: GUID-07E441C6-BBB2-47EC-8C62-81FC0F6FF78E
Visible to Intel only — GUID: GUID-07E441C6-BBB2-47EC-8C62-81FC0F6FF78E
Deadlock
Occurs when two or more threads are waiting for each other to release resources (such as mutexes, critical sections, and thread handles) while holding resources the other threads are trying to acquire. If none of the threads release their resources, then none of the threads can proceed.
ID |
Code Location |
Description |
|---|---|---|
1 |
Allocation site |
If present, represents the location and associated call stack where the resource was created. |
2 |
Lock owned |
Represents the location and associated call stack of the thread holding the object requested by another thread. |
3 |
Lock wanted |
Represents the location and associated call stack of the thread requesting the object held by another thread. |
Deadlock problems are usually, but not always, caused by Lock hierarchy violation problems. If the Intel Inspector detects a Deadlock problem caused by a Lock hierarchy violation problem, it reports only the Deadlock problem.
Intel Inspector cannot detect a Deadlock problem involving more than four threads.
Preparation |
CRITICAL_SECTION cs1; CRITICAL_SECTION cs2; int x = 0; int y = 0; InitializeCriticalSection(&cs1); // Allocation Site (cs1) InitializeCriticalSection(&cs2); // Allocation Site (cs2) |
Thread #1 |
EnterCriticalSection(&cs1); // Lock Owned (cs1) x++; EnterCriticalSection(&cs2); // Lock Wanted (cs2) y++; LeaveCriticalSection(&cs2); LeaveCriticalSection(&cs1); |
Thread #2 |
EnterCriticalSection(&cs2); // Lock Owned (cs2) y++; EnterCriticalSection(&cs1); // Lock Wanted (cs1) x++; LeaveCriticalSection(&cs1); LeaveCriticalSection(&cs2); |
If thread #1 and thread #2 are concurrent and there is no other synchronization between them, the Intel Inspector detects a Deadlock problem if synchronization occurs in the following order:
EnterCriticalSection(&cs1); in thread #1
EnterCriticalSection(&cs2); in thread #2
Preparation |
include "omp_lib.h" integer(omp_lock_kind) lock1 integer(omp_lock_kind) lock2 call omp_init_lock(lock1) call omp_init_lock(lock2) |
Thread #1 |
call omp_set_lock(lock1) . . . call omp_set_lock(lock2) . . . call omp_unset_lock(lock2) . . . call omp_unset_lock(lock1) |
Thread #2 |
call omp_set_lock(lock2) . . . call omp_set_lock(lock1) . . . call omp_unset_lock(lock1) . . . call omp_unset_lock(lock2) |
If thread #1 and thread #2 are concurrent and there is no other synchronization between them, the Intel Inspector detects a Deadlock problem if synchronization occurs in the following order:
call omp_set_lock(lock1) in thread #1
call omp_set_lock(lock2) in thread #2
Do not use multiple synchronization objects if one synchronization object is sufficient.
Use recursive synchronization objects such as recursive mutexes if a thread must acquire the same object more than once.
Avoid the case where two threads wait for each other to terminate. Instead, use a third thread to wait for both threads to terminate.
Establish a global lock hierarchy and honor the same lock hierarchy in each thread. For example:
C language: If you have critical sections cs1 and cs2 and establish a global lock hierarchy (cs1 , cs2), always acquire cs1 before acquiring cs2 and release cs1 after releasing cs2.
Fortran language: If you have locks lock1 and lock2 and establish a global lock hierarchy (lock1, lock2), always acquire lock1 before acquiring lock2 and release lock1 after releasing lock2.
C language: Consider acquiring multiple synchronization objects at the same time using, for example, Microsoft Windows* system APIs such as WaitForMultipleObjects().