ACM Home Page
Please provide us with feedback. Feedback
An algorithm for replicated directories
Full text PdfPdf (1.31 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 20 ,  Issue 1  (January 1986) table of contents
Pages: 24 - 43  
Year of Publication: 1986
ISSN:0163-5980
Authors
Alfred Z Spector  Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania
Dean Daniels  Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 4
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/12485.12489
What is a DOI?

ABSTRACT

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.



Collaborative Colleagues:
Alfred Z Spector: colleagues
Dean Daniels: colleagues