Data-Parallel Hashing Techniques for GPU Architectures
Brenton Lessley
Committee: Hank Childs (chair), Boyana Norris, Chris Wilson
Area Exam(Jan 2018)
Keywords: GPU; Hashing; Data-Parallel; Data Structure

Hash tables are one of the most fundamental data structures for effectively storing and accessing sparse data, with widespread usage in domains ranging from computer graphics to machine learning. This study surveys the state-of-the-art research on data-parallel hashing techniques for emerging massively-parallel, many-core GPU architectures. Key factors affecting the performance of different hashing schemes are discovered and used to suggest best practices and pinpoint areas for further research.