Asynchronous Consensus with Bounded Memory - Archive ouverte HAL Access content directly
Reports Year :

Asynchronous Consensus with Bounded Memory


We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and a O(n log(n))-bits 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.
Fichier principal
Vignette du fichier
paper.pdf (160.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00988590 , version 1 (08-05-2014)


  • HAL Id : hal-00988590 , version 1


Carole Delporte-Gallet, Hugues Fauconnier. Asynchronous Consensus with Bounded Memory. 2014. ⟨hal-00988590⟩
121 View
262 Download


Gmail Facebook Twitter LinkedIn More