Coherent parallel hashing
Open Access
- 12 December 2011
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 30 (6), 1-8
- https://doi.org/10.1145/2070781.2024195
Abstract
Recent spatial hashing schemes hash millions of keys in parallel, compacting sparse spatial data in small hash tables while still allowing for fast access from the GPU. Unfortunately, available schemes suffer from two drawbacks: Multiple runs of the construction process are often required before success, and the random nature of the hash functions decreases access performance. We introduce a new parallel hashing scheme which reaches high load factor with a very low failure rate. In addition our scheme has the unique advantage to exploit coherence in the data and the access patterns for faster performance. Compared to existing approaches, it exhibits much greater locality of memory accesses and consistent execution paths within groups of threads. This is especially well suited to Computer Graphics applications, where spatial coherence is common. In absence of coherence our scheme performs similarly to previous methods, but does not suffer from construction failures. Our scheme is based on the Robin Hood scheme modified to quickly abort queries of keys that are not in the table, and to preserve coherence. We demonstrate our scheme on a variety of data sets. We analyze construction and access performance, as well as cache and threads behavior.Keywords
Funding Information
- Ministerio de Ciencia e Innovación (TIN2010-20590-C02-02)
- European Research Council (GOODSHAPE FP7-ERCStG-205693)
- Agence Nationale de la Recherche (SIMILAR-CITIES 2008-COORD-021-01)
This publication has 7 references indexed in Scilit:
- Real-time parallel hashing on the GPUACM Transactions on Graphics, 2009
- External perfect hashing for very large key setsPublished by Association for Computing Machinery (ACM) ,2007
- Perfect spatial hashingACM Transactions on Graphics, 2006
- Cuckoo hashingJournal of Algorithms, 2004
- On Worst-Case Robin Hood HashingSIAM Journal on Computing, 2004
- Non-expansive hashingPublished by Association for Computing Machinery (ACM) ,1996
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957