Skip to search formSkip to main contentSkip to account menu

Deadlock

Known as: Deadlocks, Live-locks, Coffman conditions 
In concurrent computing, a deadlock occurs when two competing actions wait for the other to finish, and thus neither ever does. Deadlock is a common… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Concurrency-related errors, such as data races, are frustratingly difficult to track down and eliminate in large object-oriented… 
Highly Cited
2011
Highly Cited
2011
The LTSMIN toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically… 
2005
2005
MSC is a visual formalism for specifying the behavior of systems. To obtain implementations for individual processes, the MSC… 
Highly Cited
1999
Highly Cited
1999
This paper uses siphons to analyze the class of Petri nets constructed by a modular approach by Jeng and DiCesare (1995) for… 
Highly Cited
1995
Highly Cited
1995
Active messages provide a low latency communication architecture which on modern parallel machines achieves more than an order of… 
Highly Cited
1991
Highly Cited
1991
A highly parallel computer with distributed memory called the AP1000 has been developed. The system consists of 64 and 1024… 
1977
1977
Three different operating system strategies for a parallel processor computer system are compared, and the most effective…