Split-ordered lists

DOI10.1145/1147954.1147958MaRDI QIDQ5900519zbMATH OpenOpenAlexFDO

Authors Ori Shalev, Nir Shavit

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

compare-and-swapconcurrent data structureshash tablenon-blocking synchronization

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Split-ordered lists
• Lock-free dynamic hash tables with open addressing
• Distributed Computing
• Concurrent operations in linear hashing
• Hopscotch Hashing

Cited in

(10)

• Lock-free dynamic hash tables with open addressing
• Solo-valency and the cost of coordination
• On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
• Hopscotch Hashing
• Distributed Computing
• Split-ordered lists, lock-free extensible hash tables
• Parallel implementations of Brunotte's algorithm
• Lock-free parallel dynamic programming
• Concurrent encrypted multimaps
• Concurrent operations in linear hashing

This page was built for publication: Split-ordered lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900519)