The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit
Guerraoui, Rachid; Hadzilacos, Vassos; Kuznetsov, Petr; Toueg, Sam
2012

Files

Abstract

We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the weakest failure detectors for these two problems in all environments, regardless of the number of faulty processes.

Details

Title The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit
Author(s) Guerraoui, Rachid ; Hadzilacos, Vassos ; Kuznetsov, Petr ; Toueg, Sam
Published in Siam Journal On Computing
Pagination 37
Volume 41
Issue 6
Pages 1343-1379
Date 2012
Publisher Philadelphia, Society for Industrial and Applied Mathematics
ISSN 0097-5397
Keywords
DOI https://doi.org/10.1137/070698877
Other identifier(s) View record in Web of Science
Laboratories DCL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > DCL - Distributed Computing Laboratory
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2013-03-28

Actions

Preview