Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Concurrency control algorithms for multiversion database systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed data base management: Some thoughts and analyses
ACM '80 Proceedings of the ACM 1980 annual conference
DEADLOCK DETECTION IN COMPUTER NETWORKS
DEADLOCK DETECTION IN COMPUTER NETWORKS
Decentralized algorithms in distributed systems
Decentralized algorithms in distributed systems
Distributed deadlock detection in distributed database systems
Distributed deadlock detection in distributed database systems
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Replication and consistency: being lazy helps sometimes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hi-index | 0.00 |
Distributed algorithms tend to be difficult to understand and even more difficult to prove correct. Using distributed dead-lock detection as a running example this paper presents a framework for stating, understanding, and proving the correctness of distributed algorithms for decision problems. The framework consists of a series of complexity levels. To simplify the initial levels, we treat the data structure of the algorithm as a database, and use the database notions of views and transaction atomicity. For each complexity level, we state theorems that need to be proved for each algorithm. The framework is illustrated using several existing deadlock detection algorithms. Finally, it is shown that the framework suggests new algorithms using the best features of several existing algorithms.