Abstract
Some replication algorithms guarantee that all updates are performed in the same order at all replicas. Others only guarantee that updates are executed in causal order; updates that are not causally related may be performed in different orders at different replicas. This paper discusses the conditions under which the two schemes are applicable and describes an algorithm from each class. It also compares the performance of the algorithms and identifies the situations in which one is superior to the other.
Supported in part by the Advanced Research Projects Agency of the Department of Defense, monitored by the Office of Naval Research under contract N00014-91-J-4136 and in part by the National Science Foundation under Grant CCR-8822158
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Alsberg and J. Day., A principle for resilient sharing of distributed resources. In Proc. of the 2nd International Conference on Software Engineering, pages 627–644, October 1976.
P. A. Bernstein and N. Goodman., An algorithm for concurrency control and recovery in replicated distributed databases. ACM Trans, on Database Systems, 9 (4): 596–615, December 1984.
P. A. Bernstein, V. Hadzilacos, and N. Goodman., Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987.
K. Birman, A. Schiper, and P. Stephenson., Lightweight causal and atomic group multicast. ACM Trans, on Computer Systems, 9 (3), August 1991.
A. El-Abbadi, D. Skeen, and F. Cristian., An efficient fault-tolerant protocol for replicated data management. In Proc. of the Fourth Symposium on Principles of Database Systems, pages 215–229, ACM, 1985.
A. El-Abbadi and S. Toueg., Maintaining availability in partitioned replicated databases. In Proc. of the Fifth Symposium on Principles of Database Systems, pages 240–251, ACM, 1986.
S. Ghemawat., Automatic Replication for Highly Available Services. Technical Report MIT/LCS/TR-473, MIT Laboratory for Computer Science, Cambridge, MA, 1990.
D. Gifford., Information Storage in a Decentralized Computer System. Technical Report CSL-81-8, Xerox Corporation, March 1983.
D. K. Gifford., Weighted voting for replicated data. In Proc. of the Seventh Symposium on Operating Systems Principles, pages 150–162, ACM SIGOPS, Pacific Grove, CA, December 1979.
M. Herlihy., A quorum-consensus replication method for abstract data types. ACM Trans. on Computer Systems, 4 (l): 32–53, February 1986.
A. Hisgen, A. Birrell, C. Jerian, T. Mann, M. Schroeder, and G. Swart., Granularity and semantic level of replication in the Echo distributed file system. In Proc. of the Workshop on Management of Replicated Data, IEEE, Houston, TX, November 1990.
D. J. Hwang. Constructing a Highly-Available Location Service for a Distributed Environment Technical Report MIT/LCS/TR-410, M.I.T. Laboratory for Computer Science, Cambridge, MA, November 1987.
R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat., Providing high availability using lazy replication. ACM Trans, on Computer Systems, 10 (4): 360–391, November 1992.
L. Lamport., Time, clocks, and the ordering of events in a distributed system. Comm. of the ACM, 21 (7): 558–565, July 1978.
B. Liskov., Practical uses of synchronized clocks in distributed systems. To appear in Distributed Computing.
B. Liskov, S. Ghemawat, R. Gruber, P. Johnson, L. Shrira, and M. Williams., Replication in the Harp file system. In Proc. of the Thirteenth ACM Symposium on Operating Systems Principles, October 1991.
B. M. Oki., Viewstamped Replication for Highly Available Distributed Systems. Technical Report MIT/LCS/TR-423, MIT Laboratory for Computer Science, Cambridge, MA, 1988.
B. M. Oki and B. Liskov., Viewstamped replication: a new primary copy method to support highly-available distributed systems. In Proc. of the 7th ACM Symposium on Principles of Distributed Computing, ACM, August 1988.
J. Paris., Voting with witnesses: a consistency scheme for replicated files. In Proc. of the 6th International Conference on Distributed Computer Systems, pages 606–612, IEEE, 1986.
R. D. Schlichting and F. B. Schneider., Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Trans, on Computing Systems, l(3): 222–238, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liskov, B. (1993). Replication Algorithms for Highly-Available Systems. In: Spies, P.P. (eds) Europäischer Informatik Kongreß Architektur von Rechensystemen Euro-ARCH ’93. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78565-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-78565-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57315-9
Online ISBN: 978-3-642-78565-8
eBook Packages: Springer Book Archive