A pessimistic consistency control algorithm for replicated files which achieves high availability
Open Access
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (1) , 39-46
- https://doi.org/10.1109/32.21724
Abstract
A consistency control algorithm is described for managing replicated files in the face of network partitioning due to node or communication link failures. It adopts a pessimistic approach in that mutual consistency among copies of a file is maintained by permitting files to be accessed only in a single partition at any given time. The algorithm simplifies the Davcev-Burkhard dynamic voting algorithm (1985) and also improves its availability by adding the notion of linearly ordered copies. A proof that any pessimistic algorithm with fresh reads is one-copy serializable is given.Keywords
This publication has 10 references indexed in Scilit:
- Dynamic votingPublished by Association for Computing Machinery (ACM) ,1987
- Consistency and recovery control for replicated filesPublished by Association for Computing Machinery (ACM) ,1985
- Site Initialization, Recovery, and Backup in a Distributed Database SystemIEEE Transactions on Software Engineering, 1984
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- A Formal Model of Crash Recovery in a Distributed SystemIEEE Transactions on Software Engineering, 1983
- The failure and recovery problem for replicated databasesPublished by Association for Computing Machinery (ACM) ,1983
- Resilient Extended True-Copy Token Scheme for a Distributed Database SystemIEEE Transactions on Software Engineering, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979