Delporte-Gallet CFauconnier HHorn SToueg SAguilera MAspnes J(2005)Fast fault-tolerant agreement algorithmsProceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing10.1145/1073814.1073847(169-178)Online publication date: 17-Jul-2005
https://dl.acm.org/doi/10.1145/1073814.1073847
Parvédy PRaynal MGibbons PAdler M(2004)Optimal early stopping uniform consensus in synchronous systems with process omission failuresProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007963(302-310)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007963
Delporte-Gallet CFauconnier HHelary JRaynal M(2003)Early stopping in Global Data ComputationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2003.123371314:9(909-921)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1109/TPDS.2003.1233713

Index Terms

Early-stopping Terminating Reliable Broadcast protocol for general-omission failures

Recommendations

Optimal early stopping uniform consensus in synchronous systems with process omission failures
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

Consensus is a central problem of fault-tolerant distributed computing that, in the context of synchronous distributed systems, has received a lot of attention in the crash failure model and in the Byzantine failure model. This paper considers ...
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures
Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder

The k-set agreement problem is a generalization of the consensus problem: considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and ...
Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures
SIROCCO'06: Proceedings of the 13th international conference on Structural Information and Communication Complexity

The k-set agreement problem is a generalization of the consensus problem: considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

May 1996

344 pages

ISBN:0897918002

DOI:10.1145/248052

Chairmen:
James E. Burns
Bellcore
,
Yoram Moses
Weizmann Institute of Science

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC96

Sponsor:

PODC96: 15th Annual ACM Symposium on Principles of Distributed Computing

May 23 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

PODC '96 Paper Acceptance Rate 69 of 117 submissions, 59%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
486
Total Downloads

Downloads (Last 12 months)93
Downloads (Last 6 weeks)22

Reflects downloads up to 23 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Delporte-Gallet CFauconnier HHorn SToueg SAguilera MAspnes J(2005)Fast fault-tolerant agreement algorithmsProceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing10.1145/1073814.1073847(169-178)Online publication date: 17-Jul-2005
https://dl.acm.org/doi/10.1145/1073814.1073847
Parvédy PRaynal MGibbons PAdler M(2004)Optimal early stopping uniform consensus in synchronous systems with process omission failuresProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007963(302-310)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007963
Delporte-Gallet CFauconnier HHelary JRaynal M(2003)Early stopping in Global Data ComputationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2003.123371314:9(909-921)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1109/TPDS.2003.1233713

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Optimal early stopping uniform consensus in synchronous systems with process omission failures

Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures

Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures