Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2024156.2024195 | ACM Trans. Graph. |
Keywords | DocType | Volume |
available scheme,spatial coherence,fast access,construction failure,access pattern,robin hood scheme,access performance,construction process,memory access,coherent parallel | Journal | 30 |
Issue | ISSN | Citations |
6 | 0730-0301 | 4 |
PageRank | References | Authors |
0.48 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ismael García | 1 | 10 | 1.61 |
| Sylvain Lefebvre | 2 | 1074 | 62.54 |
| Samuel Hornus | 3 | 166 | 12.52 |
| Anass Lasram | 4 | 70 | 4.12 |