Asynchronous Consensus with Bounded MemoryReport as inadecuate

Asynchronous Consensus with Bounded Memory - Download this document for free, or read online. Document in PDF available to download.

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

Abstract : 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 Ologn bits. Then we get a On logn-bits size complexity consensus algorithm with single-writer multi-reader SWMR registers and a On logn-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.

Keywords : Shared memory space complexity consensus

Author: Carole Delporte-Gallet - Hugues Fauconnier -



Related documents