skip to main content
10.1145/1141277.1141441acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

From spontaneous total order to uniform total order: different degrees of optimistic delivery

Published: 23 April 2006 Publication History

Abstract

A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be expensive both in terms of communication steps and of number of messages exchanged. This problem is exacerbated in large-scale systems, where the performance of the algorithm may be limited by the presence of high-latency links.Optimistic total order protocols have been proposed to alleviate this problem. However, different optimistic protocols offer quite distinct services. This paper makes an overview of different optimistic approaches and shows how they can be combined in a single adaptive protocol.

References

[1]
The SSF Net project: http://www.ssfnet.org.
[2]
K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. Technical Report 87-811, Department of Computer Science, Cornell University, Ithaca, New York, February 1987.
[3]
D. Powell (Guest Ed.). Special issue on group communication. Communications of the ACM, 39(4):50--97, 1996.
[4]
P. Felber and A. Schiper. Optimistic active replication. In Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS'2001), Phoenix, Arizona, USA, April 2001. IEEE Computer Society.
[5]
R. Guerraoui and A. Schiper. Software-based replication for fault tolerance. IEEE Computer, 30(4):68--74, 1997.
[6]
M. Hayden. The Ensemble System. PhD thesis, Cornell University, Computer Science Department, 1998.
[7]
Y. Lin, B. Kemme, M. Patiño-Martnez, and R. Jiménez-Peris. Consistent data replication: Is it feasible in wans? In Proceedings of Europar Conf. (EUROPAR), 2005.
[8]
X. Liu and R. van Renesse. Fast protocol transition in a distributed environment. In Proceedings of the 19th ACM Conference on Principles of Distributed Computing (PODC 2000), page 341, Portland, OR, July 2000.
[9]
H. Miranda, A. Pinto, and L. Rodrigues. Appia, a flexible protocol kernel supporting multiple coordinated channels. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 707--710, Phoenix, Arizona, April 2001. IEEE.
[10]
D. Nicol, J. Liu, M. Liljenstam, and G. Yan. Simulation of large-scale networks using ssf. In Proceedings of the 2003 Winter Simulation Conference, 2003.
[11]
F. Pedone and A. Schiper. Optimistic atomic broadcast. In Proceedings of the 12th International Symposium on Distributed Computing (DISC'98), 1998.
[12]
A. Sousa, J. Pereira, F. Moura, and R. Oliveira. Optimistic total order in wide area networks. In Proc. 21st IEEE Symposium on Reliable Distributed Systems, pages 190--199. IEEE CS, October 2002.
[13]
R. van Renesse, K. Birman, R. Cooper, B. Glade, and P. Stephenson. Reliable Multicast between Microkernels. In Proceedings of the USENIX workshop on Micro-Kernels and Other Kernel Architectures, pages 27--28, April 1992.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '06: Proceedings of the 2006 ACM symposium on Applied computing
April 2006
1967 pages
ISBN:1595931082
DOI:10.1145/1141277
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 April 2006

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SAC06
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2010)Practical database replicationReplication10.5555/2172338.2172351(253-285)Online publication date: 1-Jan-2010
  • (2010)Practical Database ReplicationReplication10.1007/978-3-642-11294-2_13(253-285)Online publication date: 2010
  • (2007)A framework to support multiple reconfiguration strategiesProceedings of the 1st international conference on Autonomic computing and communication systems10.5555/1365562.1365582(1-10)Online publication date: 28-Oct-2007
  • (2007)Enterprise Grids: Challenges AheadJournal of Grid Computing10.1007/s10723-007-9071-y5:3(283-294)Online publication date: 2-Mar-2007
  • (2006)On Statistically Estimated Optimistic Delivery in Wide-Area Total Order ProtocolsProceedings of the 12th Pacific Rim International Symposium on Dependable Computing10.1109/PRDC.2006.47(202-209)Online publication date: 18-Dec-2006
  • (2006)A Pragmatic Protocol for Database Replication in Interconnected ClustersProceedings of the 12th Pacific Rim International Symposium on Dependable Computing10.1109/PRDC.2006.11(230-237)Online publication date: 18-Dec-2006
  • (2006)Towards a generic group communication serviceProceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II10.1007/11914952_34(1485-1502)Online publication date: 29-Oct-2006
  • (2006)Run-time switching between total order algorithmsProceedings of the 12th international conference on Parallel Processing10.1007/11823285_60(582-591)Online publication date: 28-Aug-2006

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media