Amanote Research

Amanote Research

    RegisterSign In

The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit

SIAM Journal on Computing - United States
doi 10.1137/070698877
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

January 1, 2012

Authors
Rachid GuerraouiVassos HadzilacosPetr KuznetsovSam Toueg
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Nonblocking Commit Protocols

1981English

Nonblocking Commit Protocols

1981English

Token-Based Atomic Broadcast Using Unreliable Failure Detectors

2004English

On the Weakest Failure Detector Ever

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2009English

Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms

English

Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

The Weakest Failure Detector for Wait-Free Dining Under Eventual Weak Exclusion

2009English

To Commit or Not to Commit: Endogenous Timing in Experimental Duopoly Markets

Games and Economic Behavior
EconomicsEconometricsFinance
2002English

Computing the Optimal Strategy to Commit To

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy