Transactions and consistency in distributed database systems
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Guardians and actions: linguistic support for robust, distributed programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An open operating system for a single-user machine
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Accent: A communication oriented network operating system kernel
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
LOCUS a network transparent, high reliability distributed system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Specification and implementation of resilient, atomic data types
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Information storage in a decentralized computer system
Information storage in a decentralized computer system
Transactions: a construct for reliable distributed computing
ACM SIGOPS Operating Systems Review
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
Distributed logging for transaction processing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Distributed transactions for reliable systems
Proceedings of the tenth ACM symposium on Operating systems principles
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
This paper describes a replication algorithm for directory objects based upon Gifford's weighted voting for files. The algorithm associates version number with each possible key on every replica and thereby resolves an ambiguity that arises when directory entries are not stored in every replica. The range of keys associated with a version number changes dynamically; but in all instances, a separate version number is associated with each entry stored on every replica. The algorithm exhibits favorable availability and concurrency properties. There is no performance penalty for associating a version number with every possible key except on Delete operations, and simulation results show this overhead is small.