Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,982,482 papers from all fields of science
Search
Sign In
Create Free Account
Deadlock
Known as:
Deadlocks
, Live-locks
, Coffman conditions
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Absolute probability judgement
Abstract Window Toolkit
Banker's algorithm
Barrel processor
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
D ESIGN AND S IMULATION OF AN I NTELLIGENT T RAFFIC C ONTROL S YSTEM
Osigwe Uchenna Chinyere
,
Oladipo Onaolapo Francisca
2011
Corpus ID: 212453110
This paper described our research experiences of building an intelligent system to monitor and control road traffic in a Nigerian…
Expand
2006
2006
FRoots: A Fault Tolerant and Topology-Flexible Routing Technique
Ingebjørg Theiss
,
Olav Lysne
IEEE Transactions on Parallel and Distributed…
2006
Corpus ID: 15807238
Existing solutions for fault-tolerant routing in interconnection networks either work for only one given regular topology, or…
Expand
1997
1997
Discrete-time process algebra with empty process
J. Baeten
,
J. Vereijken
1997
Corpus ID: 6192290
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this…
Expand
Highly Cited
1996
Highly Cited
1996
ServerNet deadlock avoidance and fractahedral topologies
R. Horst
Proceedings of the International Conference on…
1996
Corpus ID: 17957787
This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies…
Expand
1993
1993
Automatic Synthesis of Fast Compact Self-Timed Control Circuits
William S. Coates
,
A. Davis
,
K. Stevens
1993
Corpus ID: 14913134
We present a tool called MEAT which has been designed to automatically synthesize transistor level, CMOS, self-timed control…
Expand
1992
1992
Mesh and Torus Chaotic Routing
K. Bolding
,
L. Snyder
1992
Corpus ID: 15303473
The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast…
Expand
1988
1988
Performance Evaluation of Global Reading of Entire Databases
C. Pu
,
C. Hong
,
Jae M. Wha
Proceedings [] International Symposium on…
1988
Corpus ID: 2085083
Using simulation and probabilistic analysis, we study the performance of an algorithm to read entire databases with locking…
Expand
1977
1977
A Parallel Processor Operating System Comparison
G. Nutt
IEEE Transactions on Software Engineering
1977
Corpus ID: 6161024
Three different operating system strategies for a parallel processor computer system are compared, and the most effective…
Expand
1972
1972
Negotiation constraints in the risk-taking domain: Effects of being observed by partners of higher or lower status
N. Kogan
,
H. Lamm
,
G. Trommsdorff
1972
Corpus ID: 16905911
This study examined the effects of status held in a reference group and of prior issue commitment on the risky shift and other…
Expand
1971
1971
A Theory of Asynchronous Control Networks
J. Bruno
,
Stanley M. Altman
IEEE transactions on computers
1971
Corpus ID: 1497328
A digital system can be viewed as an interaction of two structures, a data flow structure and a control structure. In this paper…
Expand