Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

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

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.
Fichier principal
Vignette du fichier
PI-1959.pdf (465.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00536089 , version 1 (15-11-2010)

Identifiers

  • HAL Id : inria-00536089 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More