Fault-Tolerant Distributed Systems
Bernadette Charron-Bost, Xavier Ddfagot · 2001
Algorithms for solving agreement problems can be classijied in two categories: (I) those relying on fuilure detectors that we call FD-based, and (2) those that rely on a Group Membership Service that we call GMS-based. The paper discusses the advantages and limitations of these two approaches, and proposes an extension to the GMS-approach that combines the advantages of both approaches, without their drawbacks. This extension leads us to distinguish between timetriggered suspicions of processes and space-triggered exclusions.