Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
A formal model of crash recovery in a distributed system
Concurrency control and reliability in distributed systems
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems
ACM Computing Surveys (CSUR)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Communicating sequential processes
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Rough Grammar for Efficient and Fault-Tolerant Computing on a Distributed System
IEEE Transactions on Software Engineering
Deadlock detection and resolution in simulation models
WSC '94 Proceedings of the 26th conference on Winter simulation
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
| Hi-index | 0.00 |
The necessary and sufficient condition for deadlock in a distributed system and an algorithm for detection of a distributed deadlock based on the sufficient condition are formulated. The protocol formulated, checks all wait-for contiguous requests in one iteration. A cycle is detected when a query message reaches the initiator. A wait-for cycle is only the necessary condition for the distributed deadlock. A no-deadlock message is expected by the query initiator to infer a deadlock-free situation if at least one wait-for cycle is present. A no-deadlock message is issued by a dependent (query intercessor) that is not waiting-for. No no-deadlock message implies a deadlock, and processes listed in the received query messages are the processes involved in a distributed deadlock. Properties of the protocol are discussed. The authors show that a replication of a requested higher-priority (or older) process can prevent a distributed deadlock (in a continuous deadlock treatment). A replication is shown to recover (in a periodical deadlock handling) a sequence of processes from an indefinite wait-die scheme.