Lock-free linked lists and skip lists

@inproceedings{Fomitchev2004LockfreeLL,
  title={Lock-free linked lists and skip lists},
  author={Mikhail Fomitchev and Eric Ruppert},
  booktitle={PODC},
  year={2004}
}
Lock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and reliability. We present a new lock-free implementation of singly-linked lists. We prove that the worst-case amortized cost of the operations on our linked lists is linear in the length of the list plus the contention, which is better than in previous lock-free implementations of this data structure. Our implementation uses backlinks that are set when a node is… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 122 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

123 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 123 citations based on the available data.

See our FAQ for additional information.

References

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

Concurrent maintenance of skip lists

  • W. Pugh
  • Technical Report CS-TR-2222,
  • 1990
Highly Influential
12 Excerpts

Lock-free linked lists and skip lists

  • M. Fomitchev
  • Master’s thesis,
  • 2003
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…