On the Weakest Failure Detector for Non-Blocking Atomic Commit.

This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes detectors that provide information about global time but includes all known meaningful failure detectors such as P and P [CT96]. We show that, within A, the weakest failure detector for NBAC is ?P+S.

Related material