Abstract
The paper describes a new dynamic protocol for managing replicated data. Like the existing dynamic schemes, our protocol involves reconfiguring the system dynamically to reflect failures and repairs as they occur, so that the data may be kept available for user operations even if only one replica of the data remains accessible. However, in the existing schemes, it is required for the correctness of the protocol that the system reconfiguration either run as a special transaction that competes for locks with user operations and thus can interfere with and delay the latter, or be done within the protocol for the write operation, which increases the cost of writes and makes fault tolerance of the system dependent on the rate of write operations. In contrast, our protocol allows system reconfiguration to be done asynchronously with and separately from read and write operations. Therefore, in our protocol, user operations can execute while system reconfiguration is in progress, with no interference. At the same time, the cost of write operations in our protocol remains low and the fault tolerance of the system does not depend on the rate of writes.
This work is supported in part by the National Science Foundation under Grant No. CCR-9200832.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Agrawal and A. El Abbadi. An efficient solution to the distributed mutual exclusion problem. In Proc. of Symp. on Principles of Distributed Computing, pp. 193–200, 1989.
D. Barbara, H. Garcia-Molina, and A. Spauster. Increasing availability under mutual exclusion constraints with dynamic vote reassignment ACM Trans. on Comp. Sys., 7(4), pp. 394–426, November 1989.
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley, Reading, Mass., 1987.
S. Y. Cheung, M. H. Ammar, and M. Ahamad. The Grid protocol: A high performance scheme for maintaining replicated data. In Proc. of the IEEE 6th Int. Conf. on Data Engineering, pp. 438–445,1990.
A. El Abbadi and S. Toueg. Maintaining availability in partitioned replicated databases. ACM Trans. on Database Syst. 14(2), pp. 264–290, June 1989.
J. Gray. Notes on database operating systems. In Operating system: An Advanced Course, New York, Springer-Verlag, 1979.
D.K. Gifford. Weighted voting for replicated data. In Proc. of the Seventh ACM Symposium on Operating Systems Principles, pp. 150–159, December 1979.
M. Herlihy. Dynamic quorum adjustment for partitioned data. ACM Trans. on Database Syst. 12(2), pp. 170–194, 1987.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Syst. 15(2), pp. 230–280, June 1990.
A. Kumar. Performance analysis of a hierarchical quorum consensus algorithm for replicated objects. In Proc. of 10th Symp. on Distributed Computing Sys., pp. 378–385, IEEE, 1990.
R. M. Metcalfe and D. R. Boggs. Ethernet: Distributed Packet Switching for Local Computer Networks. CACM 19(7) pp. 395–404,1976.
M. Rabinovich and E. D. Lazowska. Improving fault-tolerance and supporting partial writes in structured coterie protocols for replicated objects. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 226–235, June 1992.
M. Rabinovich and E. D. Lazowska. Asynchronous epoch management in replicated databases. Technical Report 92-12-02. University of Washington Department of Computer Science, January 1993.
D. Skeen. A quorum-based commit protocol. In Proc. of the 6th Berkeley Workshop on Distr. Data Management and Comp. Networks, pp. 69–80, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabinovich, M., Lazowska, E.D. (1993). Asynchronous epoch management in replicated databases. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_31
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive