Tight bounds for anonymous adopt-commit objects

@inproceedings{Aspnes2011TightBF,
  title={Tight bounds for anonymous adopt-commit objects},
  author={James Aspnes and Faith Ellen},
  booktitle={SPAA},
  year={2011}
}
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 anonymous processes. While the upper bound is deterministic, the lower bound holds for randomized adopt-commit objects as well. Our results are based on showing that adopt-commit objects are equivalent up to small additive constants, to a simpler class of objects that we call weak conflict… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…