Simple Optimal Wait-free Multireader Registers
<|reference_start|>Simple Optimal Wait-free Multireader Registers: Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symmetric pure timestamp one that is optimal with respect to the worst-case local use of control bits; the other one is optimal with respect to global use of control bits; both are optimal in time.<|reference_end|>
@article{vitanyi2002simple,
    title={Simple Optimal Wait-free Multireader Registers},
    author={Paul Vitanyi (CWI and University of Amsterdam)},
    journal={arXiv preprint arXiv:cs/0202003},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0202003},
    primaryClass={cs.DC}
}