Answers are grounded in this paper and cite their sources.
This paper describes a replication algorithm for directory objects based upon Gifford's weighted voting for files. The algorithm associates a 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.
No takes yet. Share an insight, caveat, or question.
Spector et al. (1986) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: