Skip to Main content Skip to Navigation
Reports

The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement

Abstract : To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their algorithms to run fast in “normal” circumstances. Two orthogonal notions of “normality” have been studied in the past through failure detectors that give processes information about process crashes, and through conditions that restrict the inputs to an agreement problem. This paper investigates how the two approaches can benefit from each other to solve the k-set agreement problem, where processes must agree on at most k of their input values (when k = 1 we have the famous consensus problem). It proposes novel failure detectors for solving k-set agreement, and a protocol that combines them with conditions, establishing a new bridge among asynchronous, synchronous and partially synchronous systems with respect to agreement problems. The paper proves also a lower bound when solving the k-set agreement problem with a condition.
Document type :
Reports
Complete list of metadata

Cited literature [52 references]  Display  Hide  Download

https://hal.inria.fr/inria-00294706
Contributor : Anne Jaigu <>
Submitted on : Thursday, July 10, 2008 - 4:32:16 PM
Last modification on : Tuesday, June 15, 2021 - 4:13:44 PM
Long-term archiving on: : Friday, May 28, 2010 - 11:22:44 PM

File

PI-1897.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00294706, version 1

Citation

Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. [Research Report] PI 1897, 2008, pp.30. ⟨inria-00294706⟩

Share

Metrics

Record views

550

Files downloads

341