Asynchronous Consensus with Bounded Memory

Carole Delporte-Gallet (1, 2) , Hugues Fauconnier (1, 2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 GANG - Networks, Graphs and Algorithms

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.

Mots clés: Shared memory; space complexity; consensus

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

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