TY - GEN
T1 - Weak synchrony models and failure detectors for message passing (k-)set agreement
AU - Biely, Martin
AU - Robinson, Peter
AU - Schmid, Ulrich
N1 - Funding Information:
A brief announcement of this paper was accepted at DISC’09. Martin Biely and Peter Robinson have been supported by the Austrian BM:vit FIT-IT project TRAFT (proj. no. 812205) and the Austrian Science Foundation (FWF) project P20529, respectively. Correspondence to: Embedded Computing Systems Group (E182/2), Technische Universität Wien, Treitlstrasse 3, A-1040 Vienna (Austria). Fax: +43(1)58801-18297.
PY - 2009
Y1 - 2009
N2 - The recent discovery of the weakest failure detector for message passing set agreement has renewed the interest in exploring the border between solvable and unsolvable problems in message passing systems. This paper contributes to this research by introducing two novel system models Manti and M sink with very weak synchrony requirements, where L can be implemented. To the best of our knowledge, they are the first message passing models where set agreement is solvable but consensus is not. We also generalize L by a novel "(n-k)-loneliness" failure detector L(k), which allows to solve k-set agreement but not (k-1)-set agreement. We also present an algorithm that solves k-set agreement with L(k), which is anonymous in that it does not require unique process identifiers. This reveals that L is also the weakest failure detector for anonymous set agreement. Finally, we analyze the relationship between L(k) and other failure detectors, namely the limited scope failure detector Sn-k+1 and the quorum failure detector ∑.
AB - The recent discovery of the weakest failure detector for message passing set agreement has renewed the interest in exploring the border between solvable and unsolvable problems in message passing systems. This paper contributes to this research by introducing two novel system models Manti and M sink with very weak synchrony requirements, where L can be implemented. To the best of our knowledge, they are the first message passing models where set agreement is solvable but consensus is not. We also generalize L by a novel "(n-k)-loneliness" failure detector L(k), which allows to solve k-set agreement but not (k-1)-set agreement. We also present an algorithm that solves k-set agreement with L(k), which is anonymous in that it does not require unique process identifiers. This reveals that L is also the weakest failure detector for anonymous set agreement. Finally, we analyze the relationship between L(k) and other failure detectors, namely the limited scope failure detector Sn-k+1 and the quorum failure detector ∑.
UR - http://www.scopus.com/inward/record.url?scp=72749091526&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=72749091526&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-10877-8_23
DO - 10.1007/978-3-642-10877-8_23
M3 - Conference contribution
AN - SCOPUS:72749091526
SN - 3642108768
SN - 9783642108761
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 285
EP - 299
BT - Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings
T2 - 13th International Conference on Principles of Distributed Systems, OPODIS 2009
Y2 - 15 December 2009 through 18 December 2009
ER -