announcement

Brief Announcement: Computing in the Presence of Weak Crash Failures

Author:

Gadi TaubenfeldAuthors Info & Claims

PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

Pages 349 - 351

https://doi.org/10.1145/2933057.2933058

Published: 25 July 2016 Publication History

Get Access

Abstract

We consider an asynchronous shared memory system of n processes where processes may experience weak crash failures. A crash m-failure is a crash failure of a process that may occurs only while the point contention is at most m. It is known that there is no consensus algorithm for n processes using registers that can tolerate even a single crash n-failure. Is there a consensus algorithm for n processes using registers that can tolerate a single crash (n-1)-failure? It is known that there is no k-set consensus algorithm for n>k processes using registers that can tolerate k crash n-failures. How may crash (n-\ell)-failures can a k-set consensus algorithm using registers tolerate, as a function of n, k and l. Answers to these questions follow from our results regarding the ability to tolerate weak crash failures.

References

[1]

E. Borowsky and E. Gafni. Generalized FLP impossibility result for $t$-resilient asynchronous computations. In Proc. 25th ACM Symp. on Theory of Computing, pages 91--100, 1993.

Digital Library

Google Scholar

[2]

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

Digital Library

Google Scholar

[3]

M. P. Herlihy and N. Shavit. The topological structure of asynchronous computability. Journal of the ACM, 46(6):858--923, July 1999.

Digital Library

Google Scholar

[4]

M.C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163--183, 1987.

Google Scholar

[5]

M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing, 29, 2000.

Digital Library

Google Scholar

[6]

G. Taubenfeld. Synchronization Algorithms and Concurrent Programming. Pearson / Prentice-Hall. ISBN 0--131--97259--6, 423 pages, 2006.

Digital Library

Google Scholar

[7]

G. Taubenfeld. Computing in the presence of weak crash failures, 2016. The full version is avaliable at:\\ http://www.faculty.idc.ac.il/gadi/Publications.htm.

Digital Library

Google Scholar

Cited By

View all

Taubenfeld G(2018)A Closer Look at Fault ToleranceTheory of Computing Systems10.1007/s00224-017-9779-462:5(1085-1108)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9779-4
Taubenfeld GGiakkoupis G(2016)Brief AnnouncementProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933058(349-351)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933058

Index Terms

Brief Announcement: Computing in the Presence of Weak Crash Failures
1. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Distributed computing models

Recommendations

The Recoverable Consensus Hierarchy
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

Herlihy's consensus hierarchy ranks the power of various synchronization primitives for solving consensus in a model where asynchronous processes communicate through shared memory, and may fail by halting. This paper revisits the consensus hierarchy in ...
Reaching agreement in the presence of contention-related crash failures
Abstract
While consensus (and more generally agreement problems) is at the heart of many coordination problems in asynchronous distributed systems prone to process crashes, it has been shown to be impossible to solve in such systems where processes ...
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 ...

Comments

Information & Contributors

Information

Published In

PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

July 2016

508 pages

ISBN:9781450339643

DOI:10.1145/2933057

General Chair:
George Giakkoupis
INRIA, France

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2016

Check for updates

Author Tags

Qualifiers

Announcement

Conference

PODC '16

Sponsor:

PODC '16: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2016

Illinois, Chicago, USA

Acceptance Rates

PODC '16 Paper Acceptance Rate 40 of 149 submissions, 27%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
87
Total Downloads

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

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Taubenfeld G(2018)A Closer Look at Fault ToleranceTheory of Computing Systems10.1007/s00224-017-9779-462:5(1085-1108)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9779-4
Taubenfeld GGiakkoupis G(2016)Brief AnnouncementProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933058(349-351)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933058

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.

Cited By

Index Terms

Recommendations

The Recoverable Consensus Hierarchy

Reaching agreement in the presence of contention-related crash failures

Brief announcement: weakest failure detectors via an egg-laying simulation