A Fast Lock-Free Internal Binary Search Tree

@inproceedings{Ramachandran2015AFL,
  title={A Fast Lock-Free Internal Binary Search Tree},
  author={Arunmoezhi Ramachandran and Neeraj Mittal},
  booktitle={ICDCN},
  year={2015}
}
We present a new lock-free algorithm for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations. It combines ideas from two recently proposed lock-free algorithms: one of them provides good performance for a read-dominated workload and the other one for a write-dominated workload. Specifically, it uses internal representation of a search tree (as in the first one) and is based on marking edges instead of nodes… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The Art of Multiprocessor Programming, Revised Reprint

  • M. Herlihy, N. Shavit
  • 2012
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…