A weighted voting algorithm for replicated directories
- 1 October 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (4) , 859-909
- https://doi.org/10.1145/31846.31847
Abstract
Weighted voting is used as the basis for a replication technique for directories. This technique affords arbitrarily high data availability as well as high concurrency. Efficient algorithms are presented for all of the standard directory operations. A structural property of the replicated directory that permits the construction of an efficient algorithm for deletion is proven. Simulation results are presented and the system is modeled and analyzed. The analysis agrees well with the simulation, and the space and time performance are shown to be good for all configurations of the system.Keywords
This publication has 15 references indexed in Scilit:
- A quorum-consensus replication method for abstract data typesACM Transactions on Computer Systems, 1986
- An algorithm for replicated directoriesACM SIGOPS Operating Systems Review, 1986
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- Synchronizing shared abstract typesACM Transactions on Computer Systems, 1984
- Guardians and Actions: Linguistic Support for Robust, Distributed ProgramsACM Transactions on Programming Languages and Systems, 1983
- TransactionsACM SIGOPS Operating Systems Review, 1983
- Locking Primitives in a Database SystemJournal of the ACM, 1983
- Transactions and consistency in distributed database systemsACM Transactions on Database Systems, 1982
- The Recovery Manager of the System R Database ManagerACM Computing Surveys, 1981
- Ubiquitous B-TreeACM Computing Surveys, 1979