作者: Rachid Guerraoui , Petr Kouznetsov
DOI: 10.1007/978-0-387-35608-2_38
关键词: Global time 、 Asynchronous system 、 Detector 、 Failure detector 、 Blocking (computing) 、 Atomic commit 、 Distributed computing 、 Algorithm 、 Computer science 、 Chandra–Toueg consensus algorithm
摘要: This paper addresses the question of weakest failure detector to solve Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define set A timeless detectors which excludes that provide information about global time but includes all known meaningful such as ◊S, ◊Ƥ and Ƥ [2]. show that, within A, for NBAC is ?Ƥ + ◊S.