Abstract
Optimism is a well-known technique to enhance the performance of distributed protocols. Optimistic approaches exploit properties exhibited by the system with certain likelihood, (i.e., that certain kinds of scenarios will prevail over others) to outperform the corresponding conservative protocol. These properties are usually referred as optimistic assumptions (e.g., an optimistic assumption is that reliably multicast messages in a LAN are spontaneously totally ordered). When the optimistic assumption holds, the optimistic approach is more efficient than the conservative one. However, this gain usually implies a tradeoff. That is, if the optimistic assumption does not hold, the optimistic approach is less efficient than the conservative one. This is due to the need to undo or repair the incorrect actions and the dismissal of work already done. This is precisely the Achilles’ heel of traditional optimistic approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Amir and C. Tutu. From Total Order to Database Replication. In ICDCS, 2002.
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. AddisonWesley, Reading, MA, 1987.
K. Birman. Building Secure and Reliable Network Applications. Prentice, 1996.
Y. Breitbart, H. F. Korth, and A. Silberschatz. Optimistic protocols for replicated databases. Technical Report BL0112370-970227-07, Bell Labs, 1997.
B. Charron-Bost and F. LeFessant. Validity Conditions in Agreement Problems and Time Complexity. Technical Report 4526, INRIA, 2002.
G.V. Chockler, I. Keidar, and R. Vitenberg. Group Communication Specifications: A Comprehensive Study. ACM Computer Surveys, 33(4):427–469, December 2001.
J. Gray. Notes on Database Operating Systems. Springer, 1978.
J. Gray, P. Helland, P. O’Neil, and D. Shasha. The Dangers of Replication and a Solution. In Proc. of the SIGMOD, pages 173–182, Montreal, 1996.
R. Gupta, J. Haritsa, and K. Ramamritham. Revisiting Commit Processing in Distributed Database Systems. In Proc. of the ACM SIGMOD, 1997.
R. Jiménez-Peris, M. Patiño-Martínez, G. Alonso, and S. Arevalo. A Low-Latency Non-Blocking Atomic Commitment. In Proc. of DISC. LNCS-2180. Springer, 2001.
R. Jiménez-Peris, M. Patiño-Martínez, G. Alonso, and B. Kemme. Scalable Database Replication Middleware. In Proc. of 22nd IEEE ICDCS, Vienna, Austria, July 2002.
I. Keidar and D. Dolev. Increasing the Resilience of Atomic Commit at No Additional Cost. In Proc. of ACM Principles of Database Systems, 1995.
I. Keidar and S. Rajsbaum. On the Cost of Fault-Tolerant Consensus When There Are No Faults-A Tutorial. Technical Report MIT-LCS-TR-821, MIT CS Lab, 2001.
B. Kemme and G. Alonso. Don’t be lazy, be consistent: Postgres-R,Anewway to implement Database Replication. In Proc. of VLDB, 2000.
B. Kemme and G. Alonso. A new approach to developing and implementing eager database replication protocols. ACM TODS, 25(3):333–379, 2000.
B. Kemme, F. Pedone, G. Alonso, and A. Schiper. Processing Transactions over Optimistic Atomic Broadcast Protocols. In Proc. of ICDCS, 1999.
E. Levy, H. F. Korth, and A. Silberschatz. An optimistic commit protocol for distributed transaction management. In ACM SIGMOD Conf., 1991.
M. Patiño-Martínez, R. Jiménez-Peris, B. Kemme, and G. Alonso. Scalable Replication in Database Clusters. In Proc. of DISC. LNCS-1914. Springer, 2000. 50 Ricardo Jiménez-Peris and Marta Patiño-Martínez
F. Pedone. Boosting System Performance with Optimistic Distributed Protocols. IEEE Computer, pages 80–86, 2001.
F. Pedone, R. Guerraoui, and A. Schiper. The Database State Machine Approach. Journal of Distributed and Parallel Databases and Technology. to appear.
D. Skeen. A Quorum-Based Commit Protocol. In Proc. of the Works. on Distributed Data Management and Computer Networks, pages 69–80, 1982.
A. Sousa, J. Pereira, F. Moura, and R. Oliveira. Optimistic Total Order in Wide Area Networks. In Proc. of SRDS, 2002.
P. Vicente and L. Rodrigues. An Indulgent Uniform Total Order Algorithm with Optimistic Delivery. In Proc. of SRDS, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jiménez-Peris, R., Patiño-Martínez, M. (2003). Towards Robust Optimistic Approaches. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-37795-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00912-2
Online ISBN: 978-3-540-37795-5
eBook Packages: Springer Book Archive