Split-ordered lists

DOI10.1145/872035.872049zbMath1321.68230OpenAlexW2029881550MaRDI QIDQ5892137

Ori Shalev, Nir Shavit

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/872035.872049

zbMATH Keywords

non-blocking synchronizationreal-timehash tableconcurrent data structurescompare-and-swap

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Related Items (2)

A general lock-free algorithm using compare-and-swap ⋮ Unnamed Item

Cites Work

• Unnamed Item

This page was built for publication: Split-ordered lists