Simple Optimal Wait-free Multireader Registers
Abstract
Description
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.
11 pages LaTeX, 1 table, 2 pseudo-programs; previous version published in Proc 16th International Symposium on DIStributed Computing (DISC 2002), Lecture Notes in Computer Science, Vol 2508, Springer-Verlag, Berlin, 118-132. New version eliminates error in the protocol (merges a split scan operation that proved problematic) and defers the formal proof to a planned future I/O automaton version
11 pages LaTeX, 1 table, 2 pseudo-programs; previous version published in Proc 16th International Symposium on DIStributed Computing (DISC 2002), Lecture Notes in Computer Science, Vol 2508, Springer-Verlag, Berlin, 118-132. New version eliminates error in the protocol (merges a split scan operation that proved problematic) and defers the formal proof to a planned future I/O automaton version