Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement

  • Martin Biely
  • Peter Robinson
  • Ulrich Schmid
Conference paper

DOI: 10.1007/978-3-642-10877-8_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5923)
Cite this paper as:
Biely M., Robinson P., Schmid U. (2009) Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. In: Abdelzaher T., Raynal M., Santoro N. (eds) Principles of Distributed Systems. OPODIS 2009. Lecture Notes in Computer Science, vol 5923. Springer, Berlin, Heidelberg

Abstract

The recent discovery of the weakest failure detector \({\mathcal{L}}\) 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 \({\mathcal{M}^\text{anti}}\) and \({\mathcal{M}^\text{sink}}\) with very weak synchrony requirements, where \({\mathcal{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 \({\mathcal{L}}\) by a novel “(nk)-loneliness” failure detector \({\mathcal{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 \({\mathcal{L}}(k)\), which is anonymous in that it does not require unique process identifiers. This reveals that \({\mathcal{L}}\) is also the weakest failure detector for anonymous set agreement. Finally, we analyze the relationship between \({\mathcal{L}}(k)\) and other failure detectors, namely the limited scope failure detector \({\mathcal{S}}_{n-k+1}\) and the quorum failure detector Σ.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Martin Biely
    • 1
    • 2
  • Peter Robinson
    • 1
  • Ulrich Schmid
    • 1
  1. 1.Embedded Computing Systems GroupTechnische Universität WienAustria
  2. 2.LIXEcole polytechniqueFrance

Personalised recommendations