Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00876054
Contributor : François Taïani Connect in order to contact the contributor
Submitted on : Wednesday, October 23, 2013 - 3:39:10 PM
Last modification on : Thursday, January 20, 2022 - 4:20:37 PM
Long-term archiving on: : Friday, April 7, 2017 - 5:43:32 PM

File

PaCT_Taiani_al.pdf
Files produced by the author(s)

Identifiers

Citation

François Taïani, Barry Porter, Geoff Coulson, Michel Raynal. Cliff-Edge Consensus: Agreeing on the Precipice. 12th International Conference on Parallel Computing Technologies (PaCT-2013), Sep 2013, St. Petersburg, Russia. pp.51-64, ⟨10.1007/978-3-642-39958-9_5⟩. ⟨hal-00876054⟩

Share

Metrics

Record views

337

Files downloads

192