Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 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
2002
2002
Software Tools for the Supervisory Control of Petri Nets Based on Place Invariants
M. V. Iordache
,
P. Antsaklis
2002
Corpus ID: 6701505
A computationally efficient method for constructing Petri net controllers is presented. The method is derived using place…
Expand
1998
1998
Control Laws, Tasks and Procedures with Orccad: Application to the Control of an Underwater Arm
D. Simon
,
K. Kapellos
,
B. Espiau
International Journal of Systems Science
1998
Corpus ID: 11389430
Software reliability is a major issue in the design of control architecture for robots operating in hostile or poorly known…
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
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
1964
1964
CONCESSION-MAKING IN EXPERIMENTAL NEGOTIATIONS
O. Bartos
1964
Corpus ID: 45922991
Abstract : Two seemingly contradictory hypotheses about concession-making were considered: that concession-making occurs only as…
Expand