ACM Home Page
Please provide us with feedback. Feedback
Efficient solutions to the replicated log and dictionary problems
Full text PdfPdf (731 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the third annual ACM symposium on Principles of distributed computing table of contents
Vancouver, British Columbia, Canada
Pages: 233 - 242  
Year of Publication: 1984
ISBN:0-89791-143-1
Authors
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 67,   Citation Count: 36
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

We propose efficient algorithms to maintain a replicated dictionary using a log in an unreliable network. A non-serializable approach is used to achieve high concurrency. The solutions are resilient to both node and communication failures. Optimizations are developed for networks which are not completely connected.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
D. Dolev and R. Strong, "Distributed Commit with Bounded Waiting", IEEE Symposium on Reliability in Distributed Software and Database Systems, 1982.
6
7
 
8
9
 
10
11
12
 
13
G.T. Wuu and A.J. Bernstein, "Efficient Solutions to the Replicated Log and Dictionary Problems", Technical Report 84/077, May 1984.

CITED BY  36

Collaborative Colleagues:
Gene T.J. Wuu: colleagues
Arthur J. Bernstein: colleagues