The weakest failure detector for solving k-set agreement

Eli Gafni, Petr Kuznetsov
2009 Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09  
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact amount of synchrony needed for solving a given distributed computing problem. In this paper, we determine the weakest failure detector for solving k-set agreement among n processes (n > k) using reads and writes in shared memory, regardless of the assumptions on when and where failures might occur. This failure detector
more » ... is derived directly from the impossibility of wait-free k + 1-process k-set agreement. Our approach can be viewed as an extension of the asynchronous BG-simulation technique to partially synchronous systems.
doi:10.1145/1582716.1582735 dblp:conf/podc/GafniK09 fatcat:e2onn2fohnekrbrpf3wnae5usm