The notions of consistency and predicate locks in a database system
Communications of the ACM
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Consistency and correctness of duplicate database systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Characterization of a distributed data base system.
Characterization of a distributed data base system.
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Single-Site and Distributed Optimistic Protocols for Concurrency Control
IEEE Transactions on Software Engineering
A Dynamic Voting Scheme in Distributed Systems
IEEE Transactions on Software Engineering
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Office Information Systems and Computer Science
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Audit considerations in distributed processing systems
Communications of the ACM
Analysis of distributed commit protocols
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Is distributed locking harder?
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Performance evaluation of a two-phase commit based protocol for DDBs
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks
IEEE Transactions on Parallel and Distributed Systems
A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper)
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Edge locks and deadlock avoidance in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A distributed transaction processing protocol based on majority consensus
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Design issues in distributed multidatabase systems
SAC '86 Proceedings of the 1986 workshop on Applied computing
Virtual memory transaction management
ACM SIGOPS Operating Systems Review
Concurrency control and integrity preservation for the `RIM' DBMS
ACM SIGMIS Database
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
On the design of a reliable storage component for distributed database management systems
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Elections in a Distributed Computing System
IEEE Transactions on Computers
Data Exchange Optimization in Reconfigurable
IEEE Transactions on Computers
Efficient Internode Communications in Reconfigurable Binary Trees
IEEE Transactions on Computers
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Reconfigurable fault-tolerant multicomputer network
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
Group leader election under link-state routing
Computer Communications
Hi-index | 0.03 |
A locking protocol to coordinate access to a distributed database and to maintain system consistency throughout normal and abnormal conditions is presented. The proposed protocol is robust in the face of crashes of any participating site, as well as communication failures. Recovery from any number of failures during normal operation or any of the recovery stages is supported. Recovery is done in such a way that maximum forward progress is achieved by the recovery procedures. Integration of virtually any locking discipline including predicate lock methods is permitted by this protocol. The locking algorithm operates, and operates correctly, when the network is partitioned, either intentionally or by failure of communication lines. Each partition is able to continue with work local to it, and operation merges gracefully when the partitions are reconnected.A subroutine of the protocol, that assures reliable communication among sites, is shown to have better performance than two-phase commit methods. For many topologies of interest, the delay introduced by the overall protocol is not a direct function of the size of the network. The communications cost is shown to grow in a relatively slow, linear fashion with the number of sites participating in the transaction. An informal proof of the correctness of the algorithm is also presented in this paper.The algorithm has as its core a centralized locking protocol with distributed recovery procedures. A centralized controller with local appendages at each site coordinates all resource control, with requests initiated by application programs at any site. However, no site experiences undue load. Recovery is broken down into three disjoint mechanisms: for single node recovery, merge of partitions, and reconstruction of the centralized controller and tables. The disjointness of the mechanisms contributes to comprehensibility and ease of proof.The paper concludes with a proposal for an extension aimed at optimizing operation of the algorithm to adapt to highly skewed distributions of activity. The extension applies nicely to interconnected computer networks.