Weak failures: Definitions, algorithms and impossibility results

Gadi Taubenfeld

doi:10.1007/978-3-030-05529-5_4

Weak failures: Definitions, algorithms and impossibility results

Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The notion of weak failures, which should be viewed as fractions of traditional failures, is introduced and studied. It is known that there is no consensus algorithm using registers that can tolerate even a single crash failure. Is there a consensus algorithm using registers that can tolerate a “fraction” of a crash failure, i.e., a weak failure? It is known that there is no k-set consensus algorithm for n > k processes using registers that can tolerate k crash failures. How many weak failures can a k-set consensus algorithm which uses registers tolerate? Answers to these questions follow from our general possibility and impossibility results regarding the ability to tolerate weak failures.

Original language	English
Title of host publication	Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers
Editors	Andreas Podelski, François Taïani
Publisher	Springer Verlag
Pages	51-66
Number of pages	16
ISBN (Print)	9783030055288
DOIs	https://doi.org/10.1007/978-3-030-05529-5_4
State	Published - 2019
Externally published	Yes
Event	6th International Conference on Networked Systems, NETYS 2018 - Essaouira, Morocco Duration: 9 May 2018 → 11 May 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11028 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Networked Systems, NETYS 2018
Country/Territory	Morocco
City	Essaouira
Period	9/05/18 → 11/05/18

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2019.

Keywords

Consensus
Contention
Shared memory
Weak failures
k-set consensus

Access to Document

10.1007/978-3-030-05529-5_4

Cite this

Taubenfeld, G. (2019). Weak failures: Definitions, algorithms and impossibility results. In A. Podelski, & F. Taïani (Eds.), Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers (pp. 51-66). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11028 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05529-5_4

Taubenfeld, Gadi. / Weak failures : Definitions, algorithms and impossibility results. Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. editor / Andreas Podelski ; François Taïani. Springer Verlag, 2019. pp. 51-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4bcf484cd9eb422693ee7f3b5c2838a9,

title = "Weak failures: Definitions, algorithms and impossibility results",

abstract = "The notion of weak failures, which should be viewed as fractions of traditional failures, is introduced and studied. It is known that there is no consensus algorithm using registers that can tolerate even a single crash failure. Is there a consensus algorithm using registers that can tolerate a “fraction” of a crash failure, i.e., a weak failure? It is known that there is no k-set consensus algorithm for n > k processes using registers that can tolerate k crash failures. How many weak failures can a k-set consensus algorithm which uses registers tolerate? Answers to these questions follow from our general possibility and impossibility results regarding the ability to tolerate weak failures.",

keywords = "Consensus, Contention, Shared memory, Weak failures, k-set consensus",

author = "Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 6th International Conference on Networked Systems, NETYS 2018 ; Conference date: 09-05-2018 Through 11-05-2018",

year = "2019",

doi = "10.1007/978-3-030-05529-5_4",

language = "אנגלית",

isbn = "9783030055288",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "51--66",

editor = "Andreas Podelski and Fran{\c c}ois Ta{\"i}ani",

booktitle = "Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers",

address = "גרמניה",

}

Taubenfeld, G 2019, Weak failures: Definitions, algorithms and impossibility results. in A Podelski & F Taïani (eds), Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11028 LNCS, Springer Verlag, pp. 51-66, 6th International Conference on Networked Systems, NETYS 2018, Essaouira, Morocco, 9/05/18. https://doi.org/10.1007/978-3-030-05529-5_4

Weak failures: Definitions, algorithms and impossibility results. / Taubenfeld, Gadi.
Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. ed. / Andreas Podelski; François Taïani. Springer Verlag, 2019. p. 51-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11028 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Weak failures

T2 - 6th International Conference on Networked Systems, NETYS 2018

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - The notion of weak failures, which should be viewed as fractions of traditional failures, is introduced and studied. It is known that there is no consensus algorithm using registers that can tolerate even a single crash failure. Is there a consensus algorithm using registers that can tolerate a “fraction” of a crash failure, i.e., a weak failure? It is known that there is no k-set consensus algorithm for n > k processes using registers that can tolerate k crash failures. How many weak failures can a k-set consensus algorithm which uses registers tolerate? Answers to these questions follow from our general possibility and impossibility results regarding the ability to tolerate weak failures.

AB - The notion of weak failures, which should be viewed as fractions of traditional failures, is introduced and studied. It is known that there is no consensus algorithm using registers that can tolerate even a single crash failure. Is there a consensus algorithm using registers that can tolerate a “fraction” of a crash failure, i.e., a weak failure? It is known that there is no k-set consensus algorithm for n > k processes using registers that can tolerate k crash failures. How many weak failures can a k-set consensus algorithm which uses registers tolerate? Answers to these questions follow from our general possibility and impossibility results regarding the ability to tolerate weak failures.

KW - Consensus

KW - Contention

KW - Shared memory

KW - Weak failures

KW - k-set consensus

UR - http://www.scopus.com/inward/record.url?scp=85059930391&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-05529-5_4

DO - 10.1007/978-3-030-05529-5_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85059930391

SN - 9783030055288

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 51

EP - 66

BT - Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers

A2 - Podelski, Andreas

A2 - Taïani, François

PB - Springer Verlag

Y2 - 9 May 2018 through 11 May 2018

ER -

Taubenfeld G. Weak failures: Definitions, algorithms and impossibility results. In Podelski A, Taïani F, editors, Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. Springer Verlag. 2019. p. 51-66. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-05529-5_4

Weak failures: Definitions, algorithms and impossibility results

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this