Summary: Tight Bounds for Anonymous Adopt-Commit Objects
James Aspnes

Department of Computer Science
Yale University
New Haven, Connecticut, USA
aspnes@cs.yale.edu
Faith Ellen

Department of Computer Science
University of Toronto
Toronto, Ontario, Canada
faith@cs.toronto.edu
ABSTRACT
We give matching upper and lower bounds of
min log m
log log m
, n for the space and individual
step complexity of a wait-free m-valued adopt-commit
object implemented using multi-writer registers for n

Source: Aspnes, James - Department of Computer Science, Yale University

Collections: Computer Technologies and Information Sciences