Concurrent Robin Hood hashing

DOI10.4230/LIPICS.OPODIS.2018.10MaRDI QIDQ5091081zbMATH OpenFDO

Authors

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1809.04339

zbMATH Keywords

concurrencydata-structureshash tablesnon-blockingRobin Hood hashing

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Hopscotch Hashing
• Distributed Computing
• On Worst-Case Robin Hood Hashing
• Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions
• A new approach to analyzing Robin Hood hashing

Cites work

• A Basis for Verifying Multi-threaded Programs
• A template for implementing fast lock-free trees using HTM
• Distributed Computing
• Hopscotch Hashing
• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• scientific article; zbMATH DE number 2013836 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• Introduction to algorithms
• Split-ordered lists

Cited in

(1)

• Concurrency and trie hashing

This page was built for publication: Concurrent Robin Hood hashing

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