Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit
 
research article

The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit

Guerraoui, Rachid  
•
Hadzilacos, Vassos
•
Kuznetsov, Petr
Show more
2012
Siam Journal On Computing

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.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1137/070698877
Web of Science ID

WOS:000312600700001

Author(s)
Guerraoui, Rachid  
Hadzilacos, Vassos
Kuznetsov, Petr
Toueg, Sam
Date Issued

2012

Publisher

Society for Industrial and Applied Mathematics

Published in
Siam Journal On Computing
Volume

41

Issue

6

Start page

1343

End page

1379

Subjects

asynchronous distributed computing

•

atomic commit problem

•

consensus

•

fault-tolerant algorithms

•

failure detection

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DCL  
Available on Infoscience
March 28, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/90657
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés