![]() |
CiteULike | ![]() |
myui's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Hopscotch HashingIn DISC '08: Proceedings of the 22nd international symposium on Distributed Computing (2008), pp. 350-364.
|
Reviews
[Write a review of this article]
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotch multi-phased probing and displacement technique that has the flavors of chaining, cuckoo hashing, and linear probing, all put together, yet avoids the limitations and overheads of these former approaches. The resulting algorithms provide tables with very low synchronization overheads and high cache hit ratios.
BibTeX record
RIS record