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: Conference and Workshop Publications

see also conference papers, workshop papers, demos, and posters. (under construction)

Relating L-Resilience and Wait-Freedom via Hitting Sets
Zitatschlüssel GK-RLRWFHS-11
Autor Gafni, Eli and Kuznetsov, Petr
Buchtitel 12th International Conference on Distributed Computing and Networking (ICDCN '11)
Seiten 191–202
Jahr 2011
ISBN 978-3-642-17678-4
ISSN 0302-9743
Online ISSN 1611-3349
DOI http://dx.doi.org/10.1007/978-3-642-17679-1_17
Ort Bangalore, India
Adresse Berlin / Heidelberg, Germany
Jahrgang 6522
Monat January
Notiz nominated for best paper award
Verlag Springer
Serie Lecture Notes in Computer Science (LNCS)
Zusammenfassung The condition of t-resilience stipulates that an n-process program is only obliged to make progress when at least n-t processes are correct. Put another way, the live sets, the collection of process sets such that progress is required if all the processes in one of these sets are correct, are all sets with at least n-t processes. We show that the ability of arbitrary collection of live sets L to solve distributed tasks is tightly related to the minimum hitting set of L, a minimum cardinality subset of processes that has a non-empty intersection with every live set. For the special case of colorless tasks that allow participating processes to adopt input or output values of each other, we use a simple simulation to show that a task can be solved L-resiliently if and only if it can be solved (h-1)-resiliently, where h is the size of the minimum hitting set of L. For general tasks, we characterize L-resilient solvability of tasks with respect to a limited notion of weak solvability: in every execution where all processes in some set in L are correct, outputs must be produced for every process in some (possibly different) participating set in L. Given a task T, we construct another task T L such that T is solvable weakly L-resiliently if and only if TL is solvable weakly wait-free.
Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe

Under Construction

This page/section is
still under construc-
tion. Please try again
later.