Can I read Max Registers, Counters, and Monotone Circuits on EtoBox?

Max Registers, Counters, and Monotone Circuits by James Aspnes; Hagit Attiya; Keren Censor is a scholarly article available to read on EtoBox.

What is Max Registers, Counters, and Monotone Circuits about?

A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the largest value previously written. For fixed m, an m-valued max register can be constructed from one-bit multi-writer multireader registers at a cost of at most lg m atomic register operations per write or read. The construction takes the form of a binary search tree: applying classic techniques for building unbalanced search trees gives an unbounded max register with cost O(min(log v, n)) to read or write a value v, where n is the number of processes. It is also shown how a max register can be used to transform any monotone circuit into a wait-free concurrent data structure that provides write operations setting the inputs to the circuit and a read operation that returns the value of the circuit on the largest input values previously supplied. The cost of a write is bounded by O(Sd min( lg m , n), where m is the size of the alphabet for the circuit, S is the number of gates whose value changes as the result of the write, and d is the number of inputs to each gate; the cost of a read is min( lg m , O(n)). While t

Author

James Aspnes; Hagit Attiya; Keren Censor

Publisher

ACM

Published

2009

Language

EN