Finally the Weakest Failure Detector for Non-Blocking Atomic Commit
Recent papers [GK03,HT03] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize the result by presenting the weakest failure detector to solve NBAC in any environment, i.e., without any assumption on the number of processes that can crash. We present the result in a modular manner through determining the weakest failure detector for quittable consensus, a variant of consensus introduced by Hadzilacos and Toueg [HT03].
IC_TECH_REPORT_200378.pdf
openaccess
179.07 KB
Adobe PDF
b3254a5dd6067be53505dc3564c4fcbf