Hopscotch Hashing
| Autor: | Moran Tzafrir, Nir Shavit, Maurice Herlihy |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Computer science
Linear probing Hash function 020206 networking & telecommunications 020207 software engineering 02 engineering and technology Parallel computing Hash table Hopscotch hashing Cuckoo hashing Synchronization (computer science) Chaining 0202 electrical engineering electronic engineering information engineering Cache |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783540877783 |
| DOI: | 10.1007/978-3-540-87779-0_24 |
| Popis: | We 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 hopscotchmulti-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. In a series of benchmarks on a state-of-the-art 64-way Niagara II multicore machine, a concurrent version of hopscotch proves to be highly scalable, delivering in some cases 2 or even 3 times the throughput of today's most efficient concurrent hash algorithm, Lea's ConcurrentHashMap from java.concurr.util. Moreover, in tests on both Intel and Sun uni-processor machines, a sequential version of hopscotch consistently outperforms the most effective sequential hash table algorithms including cuckoo hashing and bounded linear probing. The most interesting feature of the new class of hopscotch algorithms is that they continue to deliver good performance when the hash table is more than 90% full, increasing their advantage over other algorithms as the table density grows. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|