Asynchronous Consensus with Bounded Memory. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2016

Asynchronous Consensus with Bounded Memory.

Abstract

We present here a bounded memory size Obstruction-Free consensus algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n+2n+2 multi-writer multi-reader registers, each of these registers being of size O(log(n))O(log⁡(n)) bits. From this, we get a bounded memory size space complexity consensus algorithm with single-writer multi-reader registers and a bounded memory size space complexity consensus algorithm in the asynchronous message passing model with a majority of correct processes. As it is easy to ensure the Obstruction-Free assumption with randomization (or with leader election failure detector ΩΩ) we obtain a bounded memory size randomized consensus algorithm and a bounded memory size consensus algorithm with failure detector.

Keywords

Dates and versions

hal-01416509 , version 1 (14-12-2016)

Identifiers

Cite

Carole Delporte-Gallet, Hugues Fauconnier. Asynchronous Consensus with Bounded Memory.. Lecture Notes in Computer Science, 2016, Networked Systems, 9944, pp.15. ⟨10.1007/978-3-319-46140-3_12⟩. ⟨hal-01416509⟩
77 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More