Cliff-Edge Consensus: Agreeing on the Precipice

  • François Taïani
  • Barry Porter
  • Geoff Coulson
  • Michel Raynal
Conference paper

DOI: 10.1007/978-3-642-39958-9_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7979)
Cite this paper as:
Taïani F., Porter B., Coulson G., Raynal M. (2013) Cliff-Edge Consensus: Agreeing on the Precipice. In: Malyshkin V. (eds) Parallel Computing Technologies. PaCT 2013. Lecture Notes in Computer Science, vol 7979. Springer, Berlin, Heidelberg

Abstract

This paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness.

Keywords

distributed computing fault-tolerance failure detection consensus scalability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • François Taïani
    • 1
  • Barry Porter
    • 3
  • Geoff Coulson
    • 4
  • Michel Raynal
    • 1
    • 2
  1. 1.IRISAUniversité de Rennes 1France
  2. 2.Institut universitaire de FranceFrance
  3. 3.School of Computer ScienceUniversity of St AndrewsUK
  4. 4.School of Computing and CommunicationsLancaster UniversityUK

Personalised recommendations