Axiomatic semantics of communicating sequential processes
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communications of the ACM
A Discipline of Programming
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
An Efficient Deadlock Avoidance Technique
IEEE Transactions on Computers
Detection and resolution of deadlocks in distributed database systems
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient detection and resolution of deadlocks in distributed databases
Computer Communications
| Hi-index | 0.01 |
The key idea of the algorithm is to let one transaction controller be in charge of all transactions in a set of interacting transactions. Two transactions are interacting if they are both interested in (accessing) the same resource. In addition, the controller is in charge of all the resources allocated to any of the transactions in the set. Having one controller in charge of all the transactions in a set of interacting transactions and all the resources allocated to them makes it easier to detect deadlocks and avoid them. The main problem dealt with is how a controller takes charge of another transaction when the transaction tries to access one of the resources currently in the control of the controller and how a controller releases a transaction back to its original controller when the transaction is no longer interested in any of the resources in which one or more of the other transactions are also interested. Communicating sequential processes (CSP) is used to code the algorithm. The correctness of the algorithm is proved in a semiformal manner.