Efficient solutions to the replicated log and dictionary problems

Authors:
Gene T J Wuu;Arthur J Bernstein
Affiliations:
Departmemnt of Computer Science, State University of New York at Stony Brook, Long Island, NY;Departmemnt of Computer Science, State University of New York at Stony Brook, Long Island, NY
Venue:
ACM SIGOPS Operating Systems Review
Year:
1986

Citing 0
Cited 2

The space complexity of long-lived and one-shot timestamp implementations

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.