TU Berlin

Internet Network ArchitecturesAll Publications

Page Content

to Navigation

All publications

The Weakest Failure Detector for Solving k-Set Agreement
Citation key GK-WFDSKA-09
Author Gafni, Eli and Kuznetsov, Petr
Year 2009
Month April
Note No. 2009-06
Institution Technische Universit├Ąt Berlin
Abstract 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 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.
Bibtex Type of Publication Forschungsbericht (Research report)
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe