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.
2004
2004
Most approaches for model checking software are based on the generation of abstract models from source code, which may greatly… 
2000
2000
Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers… 
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… 
1999
1999
  • Gregor Joeris
  • 1999
  • Corpus ID: 6734072
In this paper, we focus on the definition and adaptation of the execution behavior of a task in order to support flexible… 
Highly Cited
1996
Highly Cited
1996
This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies… 
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…