Skip to Main content Skip to Navigation

Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results

Michel Raynal 1
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : In the k-set agreement problem, each process proposes a value and has to decide a value in such a way that a decided value is a proposed value and at most k different values are decided. This problem can easily be solved in synchronous systems or in asynchronous systems prone to t process crashes when t < k. In contrast, it has been shown that k-set agreement cannot be solved in asynchronous systems when k < t. Hence, since several years, the failure detector-based approach has been investigated to circumvent this impossibility. This approach consists in enriching the underlying asynchronous system with an additional module per process that provides it with information on failures. Hence, without becoming synchronous, the enriched system is no longer fully asynchronous. This paper surveys this approach in both asynchronous shared memory systems and asynchronous message passing systems. It presents and discusses recent results and associated k-set agreement algorithms.
Document type :
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Monday, November 15, 2010 - 1:08:41 PM
Last modification on : Tuesday, June 15, 2021 - 4:27:46 PM
Long-term archiving on: : Wednesday, February 16, 2011 - 2:53:31 AM


Files produced by the author(s)


  • HAL Id : inria-00536089, version 1


Michel Raynal. Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. [Research Report] PI-1959, 2010. ⟨inria-00536089⟩



Record views


Files downloads