On the weakest failure detector for non-blocking atomic commit

Abstract

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 failure detectors that provide information about global time but includes all known meaningful failure detectors such as ◇S, ◇P and P [2]. We show that, within A, the weakest failure detector for NBAC is ?P + ◇ OS.© Springer Science+Business Media New York 2002.