On the inherent weakness of conditional primitives

@article{Ellen2005OnTI,
  title={On the inherent weakness of conditional primitives},
  author={Faith Ellen and Danny Hendler and Nir Shavit},
  journal={Distributed Computing},
  year={2005},
  volume={18},
  pages={267-277}
}
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows that, for a large class of objects, including counters, queues, stacks, and single-writer snapshots, wait-free implementations using only these primitive operations and a large class of other primitive operations cannot be space efficient: the number of base objects required is at least linear in the number of… CONTINUE READING

Similar Papers

Loading similar papers…