The weakest failure detectors to solve certain fundamental problems in distributed computing

Carole Delporte-Gallet; Vassos Hadzilacos; Hugues Fauconnier; Petr Kouznetsov; Rachid Guerraoui; Sam Toueg

doi:10.1145/1011767.1011818

The weakest failure detectors to solve certain fundamental problems in distributed computing

Carole Delporte-Gallet
, Vassos Hadzilacos
, Hugues Fauconnier
, Petr Kouznetsov
, Rachid Guerraoui
, Sam Toueg

Université Paris 7
University of Toronto
ENAC-IIC-GEL

Résultats de recherche: Contribution à une conférence › Papier › Revue par des pairs

Résumé

We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.

langue originale	Anglais
Pages	338-346
Nombre de pages	9
Les DOIs	https://doi.org/10.1145/1011767.1011818
état	Publié - 25 juil. 2004
Modification externe	Oui
Evénement	23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004 - St. John's, Nfld., Canada Durée: 25 juil. 2004 → 28 juil. 2004

Une conférence

Une conférence	23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004
Pays/Territoire	Canada
La ville	St. John's, Nfld.
période	25/07/04 → 28/07/04

Accès au document

10.1145/1011767.1011818

Contient cette citation

Delporte-Gallet, C., Hadzilacos, V., Fauconnier, H., Kouznetsov, P., Guerraoui, R., & Toueg, S. (2004). The weakest failure detectors to solve certain fundamental problems in distributed computing. 338-346. Papier présenté � 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Nfld., Canada. https://doi.org/10.1145/1011767.1011818

@conference{d7979e7accd345b186b3b069907fb85c,

title = "The weakest failure detectors to solve certain fundamental problems in distributed computing",

abstract = "We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.",

keywords = "Consensus, Non-blocking atomic commit, Quittable consensus, Register, Weakest failure detector",

author = "Carole Delporte-Gallet and Vassos Hadzilacos and Hugues Fauconnier and Petr Kouznetsov and Rachid Guerraoui and Sam Toueg",

year = "2004",

month = jul,

day = "25",

doi = "10.1145/1011767.1011818",

language = "English",

pages = "338--346",

note = "23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004 ; Conference date: 25-07-2004 Through 28-07-2004",

}

Delporte-Gallet, C, Hadzilacos, V, Fauconnier, H, Kouznetsov, P, Guerraoui, R & Toueg, S 2004, 'The weakest failure detectors to solve certain fundamental problems in distributed computing', Papier présenté � 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Nfld., Canada, 25/07/04 - 28/07/04 p. 338-346. https://doi.org/10.1145/1011767.1011818

The weakest failure detectors to solve certain fundamental problems in distributed computing. / Delporte-Gallet, Carole; Hadzilacos, Vassos; Fauconnier, Hugues et al.
2004. 338-346 Papier présenté � 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Nfld., Canada.

Résultats de recherche: Contribution à une conférence › Papier › Revue par des pairs

TY - CONF

T1 - The weakest failure detectors to solve certain fundamental problems in distributed computing

AU - Delporte-Gallet, Carole

AU - Hadzilacos, Vassos

AU - Fauconnier, Hugues

AU - Kouznetsov, Petr

AU - Guerraoui, Rachid

AU - Toueg, Sam

PY - 2004/7/25

Y1 - 2004/7/25

N2 - We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.

AB - We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.

KW - Consensus

KW - Non-blocking atomic commit

KW - Quittable consensus

KW - Register

KW - Weakest failure detector

U2 - 10.1145/1011767.1011818

DO - 10.1145/1011767.1011818

M3 - Paper

AN - SCOPUS:10444236388

SP - 338

EP - 346

T2 - 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004

Y2 - 25 July 2004 through 28 July 2004

ER -

The weakest failure detectors to solve certain fundamental problems in distributed computing

Résumé

Une conférence

Accès au document

Empreinte digitale

Contient cette citation