Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors

@inproceedings{ArbelRaviv2017ReuseDR,
  title={Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors},
  author={Maya Arbel-Raviv and Trevor Brown},
  booktitle={DISC},
  year={2017}
}
In many lock-free algorithms, threads help one another, and each operation creates a descriptor that describes how other threads should help it. Allocating and reclaiming descriptors introduces significant space and time overhead. We introduce the first descriptor abstract data type (ADT), which captures the usage of descriptors by lock-free algorithms. We then develop a weak descriptor ADT which has weaker semantics, but can be implemented significantly more efficiently. We show how a large… CONTINUE READING
1
Twitter Mention

Similar Papers

Results and Topics from this paper.

Key Quantitative Results

  • In a microbenchmark using a binary search tree (BST) implemented with LLX and SCX, our transformed implementation is up to 57% faster than the next best wasteful implementation.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

McKenney , Alan S . Stern , Michel R . Dagenais , and Jonathan Walpole . User - level implementations of Read - Copy Update

Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
  • IEEE Transactions on Parallel and Distributed Systems
  • 2012

Anderson and Mark Moir . Universal constructions for multi - object operations Highly concurrent multi - word synchronization

Greg Barnes
  • Theoretical Computer Science
  • 2011

Bolosky and Michael L . Scott . False sharing and its effect on shared memory performance Fully - adaptive algorithms for long - lived renaming

Trevor Brown
  • Distributed Computing
  • 2011

Hazard pointers: safe memory reclamation for lock-free objects

  • IEEE Transactions on Parallel and Distributed Systems
  • 2004