Article

Solving Agreement Problems with Weak Ordering Oracles

Authors:

Fernando Pedone,

André Schiper,

David CavinAuthors Info & Claims

EDCC-4: Proceedings of the 4th European Dependable Computing Conference on Dependable Computing

Pages 44 - 61

Published: 23 October 2002 Publication History

Abstract

Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past years, almost all solutions are Crash-Detection Based (CDB). We say that an algorithm is CDB if it uses some information about the status crashed/not crashed of processes. In this paper, we revisit the issue of non-CDB algorithms considering ordering oracles. Ordering oracles have a theoretical interest as well as a practical interest. To illustrate their use, we present solutions to consensus and atomic broadcast, and evaluate the performance of the atomic broadcast algorithm in a cluster of workstations.

References

[1]

M.K. Aguilera, W. Chen, and S. Toueg. Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science, 220(1):3-30, June 1999.

[2]

M.K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Thrifty generic broadcast. In Proceedings of the 14th International Symposium on Distributed Computing (DISC'2000), October 2000.

[3]

E. Anceaume. A Lightweight Solution to Uniform Atomic Broadcast for Asynchronous Systems. In IEEE 27th Int Symp on Fault-Tolerant Computing (FTCS- 27), pages 292-301, June 1997.

[4]

H. Attiya and J. Welch. Distributed Computing. Mc Graw Hill, 1998.

[5]

M. Ben-Or. Another advantage of free choice: completely asynchronous agreement protocols. In proc. 2nd annual ACM Symposium on Principles of Distributed Computing, pages 27-30, 1983.

[6]

T.D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of ACM, 43(2):225-267, 1996.

[7]

F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel & Distributed Systems, 10(6):642-657, June 1999.

[8]

D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of ACM, 34(1):77-97, January 1987.

[9]

C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288-323, April 1988.

[10]

M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, 32:374-382, April 1985.

[11]

R. Guerraoui and A. Schiper. Consensus: the Big Misunderstanding. In IEEE Proc of the Sixth Workshop on Future Trends of Distributed Computing Systems, pages 183-188, October 1997.

[12]

V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. Technical Report 94-1425, Department of Computer Science, Cornell University, May 1994.

[13]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.

[14]

A. Mostefaoui and M. Raynal. Solving Consensus using Chandra-Toueg's Unreliable Failure Detectors: A Synthetic Approach. In 13th. Intl. Symposium on Distributed Computing (DISC'99). Springer Verlag, LNCS 1693, September 1999.

[15]

A. Mostefaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11:95-107, 2001.

[16]

F. Pedone and A. Schiper. Generic Broadcast. In 13th. Intl. Symposium on Distributed Computing (DISC'99), pages 94-108. Springer Verlag, LNCS 1693, September 1999.

[17]

F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. TR IC/2002/010, EPFL, March 2002. Appears also as Technical Report HPL-2002-44, Hewlett-Packard Laboratories, March 2002.

[18]

M. Rabin. Randomized Byzantine Generals. In Proc. 24th Annual ACM Symposium on Foundations of Computer Science, pages 403-409, 1983.

[19]

A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149-157, April 1997.

[20]

PÉter Urbán, Xavier DÉfago, and AndrÉ Schiper. Neko: A single environment to simulate and prototype distributed algorithms. In Proc. of the 15th Int'l Conf. on Information Networking (ICOIN-15), Beppu City, Japan, February 2001.

Cited By

Pan HTuglu JZhou NWang TShen YZheng XTassarotti JTseng LPalmieri R(2021)RabiaProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483582(472-487)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3477132.3483582
Dang HCanini MPedone FSoulé R(2016)Paxos Made Switch-yACM SIGCOMM Computer Communication Review10.1145/2935634.293563846:2(18-24)Online publication date: 9-May-2016
https://dl.acm.org/doi/10.1145/2935634.2935638
Dang HSciascia DCanini MPedone FSoulé RRexford JVahdat A(2015)NetPaxosProceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research10.1145/2774993.2774999(1-7)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.1145/2774993.2774999
Show More Cited By

Recommendations

Weak ordering—a new definition
ISCA '90: Proceedings of the 17th annual international symposium on Computer Architecture

A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory accesses will appear to execute atomically and in program order. An ...
Preference Ordering in Agenda Based Multi-issue Negotiation for Service Level Agreement
WAINA '09: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops

This paper discusses multi-issue negotiation between agents such as providers and consumers in a group decision making environment. The outcome of such encounters depends on two key factors: the agenda (the set of issues associated with the service) and ...
Learning to improve negotiation in semi-cooperative agreement problems

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

EDCC-4: Proceedings of the 4th European Dependable Computing Conference on Dependable Computing

October 2002

281 pages

ISBN:3540000127

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 October 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pan HTuglu JZhou NWang TShen YZheng XTassarotti JTseng LPalmieri R(2021)RabiaProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483582(472-487)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3477132.3483582
Dang HCanini MPedone FSoulé R(2016)Paxos Made Switch-yACM SIGCOMM Computer Communication Review10.1145/2935634.293563846:2(18-24)Online publication date: 9-May-2016
https://dl.acm.org/doi/10.1145/2935634.2935638
Dang HSciascia DCanini MPedone FSoulé RRexford JVahdat A(2015)NetPaxosProceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research10.1145/2774993.2774999(1-7)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.1145/2774993.2774999
David TGuerraoui RYabandeh MRéveillère LCherkasova LTaïani F(2014)Consensus insideProceedings of the 15th International Middleware Conference10.1145/2663165.2663321(145-156)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1145/2663165.2663321
Milosevic ZHutle MSchiper A(2014)Tolerating permanent and transient value faultsDistributed Computing10.1007/s00446-013-0199-727:1(55-77)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1007/s00446-013-0199-7
Wilkin GEugster P(2013)Multicasting in the presence of aggregated deliveriesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.12.00473:4(544-556)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1016/j.jpdc.2012.12.004
Charron-Bost BSchiper A(2009)The Heard-Of modelDistributed Computing10.1007/s00446-009-0084-622:1(49-71)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1007/s00446-009-0084-6
Anker TDolev DGreenman GShnaiderman I(2006)Wire-speed total orderProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899076(148-148)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899076
Lamport L(2006)Fast PaxosDistributed Computing10.1007/s00446-006-0005-x19:2(79-103)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1007/s00446-006-0005-x
Schiper NSchmidt RPedone F(2006)Optimistic algorithms for partial database replicationProceedings of the 10th international conference on Principles of Distributed Systems10.1007/11945529_7(81-93)Online publication date: 12-Dec-2006
https://dl.acm.org/doi/10.1007/11945529_7
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents