Quote: when writing mutex code must manage locks, decide on lock granularity, and handle deadlock; hides important safety and progress properties [»harrT10_2003]

Quote: if resources are consumable, then deadlock avoidance is intractable; algorithms exist for reusable resources [»dennPJ_1980]

Quote: deadlocks are easy to detect; use a debugger to look at relevant threads, especially those tied to a mutex or condition variable [»birrAD_1991]

Quote: improve static reachability analysis for deadlock detection with state space reduction, symbolic model checking, and inequality necessary conditions [»corbJC3_1996]

Quote: efficient search technique for detecting deadlocks and assertion violations in concurrent programs [»godeP1_1997]

Quote: efficient, one-phase algorithm to detect generalized distributed deadlocks; outward sweep constructs wait-for-graph; inward sweep detects deadlock [»ksheAD1_1994]

Quote: each GFS namespace node has a read-write lock; consistent total order to prevent deadlock

Quote: can avoid deadlocks by eliminating circular waits with ordered resources [»dennPJ_1980]

Quote: avoid deadlocks by applying a partial order to the acquisition of mutexes; condition variables may still cause deadlocks [»birrAD_1991]

Quote: can avoid deadlocks with a data-driven network; every message includes work to be done, a process must reduce the work remaining [»dennPJ_1980]

Quote: algorithm for concurrent, tunable indexing of B*-trees; deadlock free [»bayeR_1977]

Quote: can avoid deadlocks with a hierarchical process organization; subordinates must reply and can't fill up queues [»dennPJ_1980]

Quote: binary operations on shared objects must synchronize both objects; all threads must use the same lock acquisition order [»hoveD7_2004]

Quote: for meaningful, interprocess communication need: no livelock, no deadlock, all messages handled, concurrency is order independent, serialization [»chowTS_1978]

Quote: coordinated addressing requires waiting until relevant messages arrive; needs deadlock detection [»martP1_1986]

Quote: desired properties for state machines--absence of deadlock, completeness, and liveness; catch basic flaws and unwarranted assumptions [»holzGJ5_1999]

Quote: Modula-2's scheduler can cause livelock when a consumer process is linked immediately before its producer process [»hemmD3_1988]

Quote: receive livelock--responding to interrupts all of the time; can happen with host-based routing, passive network monitoring, network file service [»moguJC8_1997]

Quote: avoid receive livelock by round-robin polling on interrupts and interrupt only when not polling; guarantees CPU for user tasks [»moguJC8_1997]

Quote: 450 lines of test driver code caught 25 timing-dependent errors; difficult to detect with conventional testing [»holzGJ5_1999]

Quote: in PORTAL, a priority is assigned to both processes and monitors; if a process inside a monitor, it takes the monitor's priority [»schiR4_1980]