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)

Related topics

Related topics

50 relations
Absolute probability judgementAbstract Window ToolkitBanker's algorithmBarrel processor

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A formal approach for the specification and verification of a Trustworthy Human Resource Discovery mechanism in the Expert Cloud
Highly Cited
2011
Highly Cited
2011
Multi-Core LTSmin: Marrying Modularity and Scalability
The LTSMIN toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically… 
Highly Cited
2000
Highly Cited
2000
Defining the Implementation Problem: Organizational Management versus Cooperation
The purpose of this article is to determine which definition of the implementation problem, organizational management or… 
Highly Cited
1999
Highly Cited
1999
Analysis of modularly composed nets by siphons
This paper uses siphons to analyze the class of Petri nets constructed by a modular approach by Jeng and DiCesare (1995) for… 
Highly Cited
1998
Highly Cited
1998
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. The algorithm distinguishes between… 
Highly Cited
1995
Highly Cited
1995
Computing without Clocks: Micropipelining the ARM Processor
High-performance VLSI microprocessors are becoming very power hungry; this presents an increasing problem of heat removal in desk… 
Highly Cited
1991
Highly Cited
1991
An architecture of highly parallel computer AP 1000
A highly parallel computer with distributed memory called the AP1000 has been developed. The system consists of 64 and 1024… 
Highly Cited
1988
Highly Cited
1988
An improved protocol reachability analysis technique
An automated analysis of all reachable states in a distributed system can be used to trace obscure logical errors that would be… 
Highly Cited
1987
Highly Cited
1987
Synthesis of Place Transition Nets for Simulation and Control of Manufacturing Systems
1977
1977
A Parallel Processor Operating System Comparison
Three different operating system strategies for a parallel processor computer system are compared, and the most effective… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)