Faster approximate agreement with multi-writer registers
E. Schenk · 2002
We consider the complexity of the wait-free approximate agreement problem in an asynchronous shared memory comprised of only single-bit multi-writer multi-reader registers. For real-valued inputs x/sub 1/,...,x/sub n/ and /spl epsiv/ we show matching upper and lower bounds of /spl Theta/(log(ma.