Split-ordered lists

DOI10.1145/1147954.1147958zbMath1326.68112OpenAlexW2084802221MaRDI QIDQ5900519

Nir Shavit, Ori Shalev

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

non-blocking synchronizationhash tableconcurrent data structurescompare-and-swap

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

Solo-valency and the cost of coordination ⋮ On the correctness of a lock-free compression-based elastic mechanism for a hash trie design ⋮ Parallel implementations of Brunotte's algorithm ⋮ Lock-free dynamic hash tables with open addressing ⋮ Hopscotch Hashing ⋮ Lock-free parallel dynamic programming

This page was built for publication: Split-ordered lists