direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Publications by Type: Technical Reports

On Set Consensus Numbers
Zitatschlüssel GK-OSCN-tr-09
Autor Gafni, Eli and Kuznetsov, Petr
Jahr 2009
Monat September
Zusammenfassung We propose a complete characterization of a large class of distributed tasks, with respect to a weakened solvability notion called it weak termination. A task is weak-termination solvable if there is an algorithm by which at least one process outputs. The proposed categorization of tasks is based on the weakest failure detectors needed to solve them. We show that every task T in the considered class is equivalent (in the failure detector sense) to some form of set agreement, and thus its solvability with weak termination is completely characterized by its set consensus number: the maximal integer K such that T can be (weak-termination) solved using read-write registers and k-set agreement objects. The characterization goes through showing that ¬Ω_k, recently shown to be the weakest failure detector for the task of k-set agreement, is necessary to solve any task that is k-resilient impossible.
Typ der Publikation Technical Report
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe