Operating systems: concepts and applications
Operating systems: concepts and applications
P.S. to operating systems
Operating systems (2nd ed.): design and implementation
Operating systems (2nd ed.): design and implementation
Notes on the methodology of CCS and CSP
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
Operating systems (3rd ed.): internals and design principles
Operating systems (3rd ed.): internals and design principles
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Understanding operating systems (3rd ed.)
Understanding operating systems (3rd ed.)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
Operating Systems: A Modern Perspective, Lab Update
Operating Systems: A Modern Perspective, Lab Update
Modern Operating Systems
Operating Systems
Operating System Concepts
Computer Networks
Operating Systems Theory
On deadlocks of exclusive AND-requests for resources
Distributed Computing
Defining deadlock with fungible resources
ACM SIGOPS Operating Systems Review
Ada and the control of intrusion
ACM SIGAda Ada Letters
Defining defects, errors, and service degradations
ACM SIGSOFT Software Engineering Notes
Priority inversion with fungible resources
ACM SIGAda Ada Letters
Computer security with service degradations
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Deadlock has been widely studied in many fields of computer science, notably in communications, database, and operating systems. Perhaps because (at least one state called) deadlock is tractable, there exists extensive literature on the subject. Deadlock was apparently decisively defined over thirty years ago, with its characteristics and handlers. Yet, much of the literature remains inconsistent in its treatment of this anomaly.A more precise definition is clearly needed to distinguish between the different states that are termed deadlock. A classification of dead states is required to distinguish the causes and appropriate handlers for each. We introduce a model to structure our research.