Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
A key factor limiting the reliability of simulations of anthropogenic climate change is the inability to accurately represent the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper describes RacerX, a static tool that uses flow-sensitive, interprocedural analysis to detect both race conditions and… Expand
  • figure 1
  • figure 2
  • table 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents a new static type system for multithreaded programs; well-typed programs in our system are guaranteed to be… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Many countries have experimented with different electoral rules in order either to increase involvement in the political system… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • F. Chu, X. Xie
  • IEEE Trans. Robotics Autom.
  • 1997
  • Corpus ID: 36498738
This paper exploits the potential of siphons for the analysis of Petri nets, It generalizes the well-known Commoner condition and… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In this paper we illustrate a compositional method for modeling the concurrent execution of working processes in flexible… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • W. Dally, H. Aoki
  • IEEE Trans. Parallel Distributed Syst.
  • 1993
  • Corpus ID: 11817172
The use of adaptive routing in a multicomputer interconnection network improves network performance by using all available paths… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • J. Duato
  • IEEE Trans. Parallel Distributed Syst.
  • 1993
  • Corpus ID: 11957711
The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Deadlocks constitute an important issue to be addressed in the design and operation of FMSs. It is shown that prevention and… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?