Compact Parallel Hash Tables on the GPU
Steef Hegeman, Daan W\"oltgens, Anton Wijs, Alfons Laarman

TL;DR
This paper introduces compact hash table schemes optimized for GPU architectures, demonstrating significant performance improvements in lookup and insertion throughput through theoretical analysis and CUDA implementation.
Contribution
It adapts compact hashing techniques to the GPU setting, providing new schemes and benchmarking them against existing methods.
Findings
Compact cuckoo hashing improves throughput by 10-20%.
Iceberg hashing achieves comparable performance to cuckoo hashing.
Both schemes support dynamic operations efficiently.
Abstract
On the GPU, hash table operation speed is determined in large part by cache line efficiency, and state-of-the-art hashing schemes thus divide tables into cache line-sized buckets. This raises the question whether performance can be further improved by increasing the number of entries that fit in such buckets. Known compact hashing techniques have not yet been adapted to the massively parallel setting, nor have they been evaluated on the GPU. We consider a compact version of bucketed cuckoo hashing, and a version of compact iceberg hashing suitable for the GPU. We discuss the tables from a theoretical perspective, and provide an open source implementation of both schemes in CUDA for comparative benchmarking. In terms of performance, the state-of-the-art cuckoo hashing benefits from compactness on lookups and insertions (most experiments show at least 10-20% increase in throughput), and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Graph Theory and Algorithms · Distributed and Parallel Computing Systems
