Home > Research > Publications & Outputs > Cliff-edge consensus
View graph of relations

Cliff-edge consensus: agreeing on the precipice

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Published

Standard

Cliff-edge consensus: agreeing on the precipice. / Taïani, Francois; Porter, Barry; Coulson, Geoffrey et al.
Parallel computing technologies: 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30 - October 4, 2013. Proceedings. ed. / Victor Malyshkin. Berlin: Springer-Verlag, 2013. p. 51-64 (Lecture Notes in Computer Science; Vol. 7979).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Harvard

Taïani, F, Porter, B, Coulson, G & Raynal, M 2013, Cliff-edge consensus: agreeing on the precipice. in V Malyshkin (ed.), Parallel computing technologies: 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30 - October 4, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7979, Springer-Verlag, Berlin, pp. 51-64. https://doi.org/10.1007/978-3-642-39958-9_5

APA

Taïani, F., Porter, B., Coulson, G., & Raynal, M. (2013). Cliff-edge consensus: agreeing on the precipice. In V. Malyshkin (Ed.), Parallel computing technologies: 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30 - October 4, 2013. Proceedings (pp. 51-64). (Lecture Notes in Computer Science; Vol. 7979). Springer-Verlag. https://doi.org/10.1007/978-3-642-39958-9_5

Vancouver

Taïani F, Porter B, Coulson G, Raynal M. Cliff-edge consensus: agreeing on the precipice. In Malyshkin V, editor, Parallel computing technologies: 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30 - October 4, 2013. Proceedings. Berlin: Springer-Verlag. 2013. p. 51-64. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-39958-9_5

Author

Taïani, Francois ; Porter, Barry ; Coulson, Geoffrey et al. / Cliff-edge consensus : agreeing on the precipice. Parallel computing technologies: 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30 - October 4, 2013. Proceedings. editor / Victor Malyshkin. Berlin : Springer-Verlag, 2013. pp. 51-64 (Lecture Notes in Computer Science).

Bibtex

@inbook{f6e24366cd2f4bbfbaea030735cdc6dd,
title = "Cliff-edge consensus: agreeing on the precipice",
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",
author = "Francois Ta{\"i}ani and Barry Porter and Geoffrey Coulson and Michel Raynal",
year = "2013",
doi = "10.1007/978-3-642-39958-9_5",
language = "English",
isbn = "9783642399572",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "51--64",
editor = "Victor Malyshkin",
booktitle = "Parallel computing technologies",

}

RIS

TY - CHAP

T1 - Cliff-edge consensus

T2 - agreeing on the precipice

AU - Taïani, Francois

AU - Porter, Barry

AU - Coulson, Geoffrey

AU - Raynal, Michel

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - distributed computing

KW - fault-tolerance

KW - failure detection

KW - consensus

KW - scalability

U2 - 10.1007/978-3-642-39958-9_5

DO - 10.1007/978-3-642-39958-9_5

M3 - Chapter

SN - 9783642399572

T3 - Lecture Notes in Computer Science

SP - 51

EP - 64

BT - Parallel computing technologies

A2 - Malyshkin, Victor

PB - Springer-Verlag

CY - Berlin

ER -