Article

Timeliness, failure-detectors, and consensus performance

Authors:

Alexander ShraerAuthors Info & Claims

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Pages 169 - 178

https://doi.org/10.1145/1146381.1146408

Published: 23 July 2006 Publication History

Abstract

We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework, GIRAF, for expressing such assumptions, and reasoning about the performance of indulgent algorithms.

References

[1]

M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Stable leader election. In DISC, pages 108--122, 2001.]]

Digital Library

[2]

M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. On implementing omega with weak reliability and synchrony assumptions. In PODC, pages 306--314, 2003.]]

Digital Library

[3]

M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Communication-efficient leader election and consensus with limited link synchrony. In PODC, pages 328--337, 2004.]]

Digital Library

[4]

O. Bakr. Performance evaluation of distributed algorithms over the Internet. Master's thesis, MIT, Feb. 03.]]

[5]

O. Bakr and I. Keidar. Evaluating the running time of a communication round over the Internet. In PODC, pages 243--252, 2002.]]

Digital Library

[6]

F. Brasileiro, F. Greve, A. Mostefaoui, and M. Raynal. Consensus in one communication step. In 6th Intl. Conference on Parallel Computing Technology, pages 42--50, Sept. 2001.]]

Digital Library

[7]

N. Cardwell, S. Savage, and T. Anderson. Modeling the performance of short tcp connections, 1998.]]

[8]

T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685--722, July 1996.]]

Digital Library

[9]

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

Digital Library

[10]

B. Charron-Bost and A. Schiper. Uniform consensus is harder than consensus. J. Algorithms, 51(1):15--37, 2004.]]

Digital Library

[11]

F. Cristian and C. Fetzer. The timed asynchronous distributed system model. In IEEE TPDS, pages 642--657, June 1999.]]

Digital Library

[12]

P. Dutha, R. Guerraoui, and I. Keidar. The overhead of consensus failure recovery. Technical Report 200456, École Polytechnique Fédérale de Lausanne, 2004.]]

[13]

P. Dutha, R. Guerraoui, and I. Keidar. The overhead of consensus failure recovery. Submitted for publication, 2005.]]

[14]

P. Dutta and R. Guerraoui. Fast indulgent consensus with zero degradation. In EDCC, Oct. 2002.]]

Digital Library

[15]

P. Dutta and R. Guerraoui. The inherent price of indulgence. In PODC, July 2002.]]

Digital Library

[16]

P. Dutta, R. Guerraoui, and L. Lamport. How fast can eventual synchrony lead to consensus?. In DSN, pages 22--27, 2005.]]

Digital Library

[17]

P. Dutta, R. Guerraoui, and B. Pochon. Tight lower bounds on early local decisions in uniform consensus. In DISC, pages 264--278, Oct 2003.]]

[18]

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

Digital Library

[19]

M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374--382, Apr. 1985.]]

Digital Library

[20]

E. Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In PODC, pages 143--152, 1998.]]

Digital Library

[21]

R. Guerraoui. Indulgent algorithms. In 19th ACM Symp. on Principles of Distributed Computing (PODC-19), pages 289--298, July 2000.]]

Digital Library

[22]

R. Guerraoui and M. Raynal. The information structure of indulgent consensus. IEEE Transactions on Computers, 53(4):453--466, 2004.]]

Digital Library

[23]

R. Guerraoui and A. Schiper. "Γ-accurate" failure detectors. In WDAG, pages 269--286, 1996.]]

Digital Library

[24]

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, May 2001.]]

[25]

I. Keidar and A. Shraer. How to choose a timing model? Technical Report CCIT 586, Department of Electrical Engineering, Technion, May 2006.]]

[26]

I. Keidar and A. Shraer. Timeliness, failure-detectors, and consensus performance. Technical Report CCIT 576, Department of Electrical Engineering, Technion, Feb. 2006.]]

Digital Library

[27]

L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133--169, May 1998.]]

Digital Library

[28]

N. Lynch and M. Tuttle. An introduction to Input/Output Automata. CWI Quarterly, 2(3):219--246, 1989.]]

[29]

D. Malkhi, F. Oprea, and L. Zhou. Omega meets paxos: Leader election and stability without eventual timely links. DISC, pages 199--213, sep 2005.]]

Digital Library

[30]

J.-P. Martin and L. Alvisi. Fast byzantine consensus. In DSN, pages 402--411, 2005.]]

Digital Library

[31]

A. Mostefaoui and M. Raynal. Solving consensus using Chandra-Toueg's unreliable failure detectors: A general quorum-based approach. In 13th Intl. Symp. on Distributed Computing, pages 49--63, Sept. 1999.]]

Digital Library

[32]

N. Santoro and P. Widmayer. Time is not a healer. 6th Annual Symp. Theor. Aspects of Computer Science, volume 349 of LNCS:304--313, feb 1989.]]

Digital Library

[33]

U. Schmid and C. Fetzer. Randomized asynchronous consensus with imperfect communications. SRDS, 00:361, 2003.]]

[34]

U. Schmid and B. Weiss. Impossibility results and lower bounds for consensus under link failures. Technical Report 183/1-129, Technische Universita"t Wien, Dept. of Automation, Apr. 2002.]]

[35]

J. L. Welch and H. Attiya. Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill, Inc., Hightstown, NJ, USA, 1998.]]

Digital Library

Cited By

Winkler KPaz AGaleana HSchmid SSchmid U(2024)The Time Complexity of Consensus Under Oblivious Message AdversariesAlgorithmica10.1007/s00453-024-01209-486:6(1830-1861)Online publication date: 13-Feb-2024
https://doi.org/10.1007/s00453-024-01209-4
Bravo MChockler GGotsman A(2024)Liveness and latency of Byzantine state-machine replicationDistributed Computing10.1007/s00446-024-00466-437:2(177-205)Online publication date: 3-May-2024
https://doi.org/10.1007/s00446-024-00466-4
Naor OKeidar I(2024)Expected linear round synchronization: the missing link for linear Byzantine SMRDistributed Computing10.1007/s00446-023-00459-937:1(19-33)Online publication date: 8-Jan-2024
https://doi.org/10.1007/s00446-023-00459-9
Show More Cited By

Index Terms

Timeliness, failure-detectors, and consensus performance
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

Unreliable failure detectors for asynchronous distributed systems
Brief announcement: weakest failure detectors via an egg-laying simulation
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

In the k-set agreement task, n processes propose values, and have to decide on at most k of these values. In particular, consensus is 1-set agreement. In PODC 2008 Zieliński showed that the anti-Ω failure detector is necessary and sufficient to solve (n ...
On the Quality of Service of Crash-Recovery Failure Detectors

We model the probabilistic behavior of a system comprising a failure detector and a monitored crash-recovery target. We extend failure detectors to take account of failure recovery in the target system. This involves extending QoS measures to include ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

July 2006

230 pages

ISBN:1595933840

DOI:10.1145/1146381

General Chair:
Eric Ruppert
York U., Canada
,
Program Chair:
Dahlia Malkhi
Microsoft Research, USA & Hebrew University, Israel

Copyright © 2006 ACM.

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 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC06

Sponsor:

PODC06: ACM Symposium on Principles of Distributed Computing 2006

July 23 - 26, 2006

Colorado, Denver, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
454
Total Downloads

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

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Winkler KPaz AGaleana HSchmid SSchmid U(2024)The Time Complexity of Consensus Under Oblivious Message AdversariesAlgorithmica10.1007/s00453-024-01209-486:6(1830-1861)Online publication date: 13-Feb-2024
https://doi.org/10.1007/s00453-024-01209-4
Bravo MChockler GGotsman A(2024)Liveness and latency of Byzantine state-machine replicationDistributed Computing10.1007/s00446-024-00466-437:2(177-205)Online publication date: 3-May-2024
https://doi.org/10.1007/s00446-024-00466-4
Naor OKeidar I(2024)Expected linear round synchronization: the missing link for linear Byzantine SMRDistributed Computing10.1007/s00446-023-00459-937:1(19-33)Online publication date: 8-Jan-2024
https://doi.org/10.1007/s00446-023-00459-9
Civit PDzulfikar MGilbert SGramoli VGuerraoui RKomatovic JVidigueira M(2023)Byzantine consensus is $$\Theta (n^2)$$: the Dolev-Reischuk bound is tight even in partial synchrony!Distributed Computing10.1007/s00446-023-00458-w37:2(89-119)Online publication date: 11-Dec-2023
https://doi.org/10.1007/s00446-023-00458-w
Birman KJha SMilano MRosa LSong WTremel E(2023)Invited Paper: Monotonicity and Opportunistically-Batched Actions in DerechoStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-44274-2_14(172-190)Online publication date: 2-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-44274-2_14
Bravo MChockler GGotsman A(2022)Making Byzantine consensus liveDistributed Computing10.1007/s00446-022-00432-y35:6(503-532)Online publication date: 2-Sep-2022
https://doi.org/10.1007/s00446-022-00432-y
Függer MNowak TSchwarz M(2021)Tight Bounds for Asymptotic and Approximate ConsensusJournal of the ACM10.1145/348524268:6(1-35)Online publication date: 28-Oct-2021
https://dl.acm.org/doi/10.1145/3485242
Chand SLiu YMiller ACensor-Hillel K(2021)Brief Announcement: What's Live? Understanding Distributed ConsensusProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467947(565-568)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467947
Shimi A(2019)The Splendors and Miseries of RoundsACM SIGACT News10.1145/3364626.336463550:3(35-50)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1145/3364626.3364635
Jha SBehrens JGkountouvas TMilano MSong WTremel ERenesse RZink SBirman K(2019)DerechoACM Transactions on Computer Systems10.1145/330225836:2(1-49)Online publication date: 2-Apr-2019
https://dl.acm.org/doi/10.1145/3302258
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents