Asynchronous Consensus with Bounded Memory

@inproceedings{DelporteGallet2016AsynchronousCW,
  title={Asynchronous Consensus with Bounded Memory},
  author={Carole Delporte-Gallet and Hugues Fauconnier},
  booktitle={NETYS},
  year={2016}
}
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… CONTINUE READING