Split-ordered lists

DOI10.1145/872035.872049MaRDI QIDQ5892137zbMATH OpenOpenAlexFDO

Authors 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

compare-and-swapconcurrent data structureshash tablenon-blocking synchronizationreal-time

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• Lock-free dynamic hash tables with open addressing
• On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
• Adaptive lock-free maps: purely-functional to scalable
• Hopscotch Hashing
• Concurrent Robin Hood hashing
• Distributed Computing
• Split-ordered lists
• A general lock-free algorithm using compare-and-swap

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 Q5892137)