| … | … | @@ -1,3 +1,15 @@ |
| 1 | # About |
| 2 | |
| 3 | This project shows how to implement a simple hash table running on a GPU. It uses atomic operations to insert key/value |
| 4 | pairs into a hash table on multiple GPU threads using linear probing. It uses CUDA for ease of development, but this can |
| 5 | easily be ported to HLSL or GLSL. |
| 6 | |
| 7 | The hash table inserts 32 bit keys and 32 bit values. Deleting from the hash table is not implemented in this simple |
| 8 | example, but it would be simple to implement deletion with tombstones. Similarly, lookups from the hash table are not |
| 9 | implemented in this simple example, but would be a linear search through the table starting at the key's hash. |
| 10 | |
| 11 | For more information on lock free hash table design, read Preshing on Programming's [The World's Simplest Lock Free Hash Table](https://preshing.com/20130605/the-worlds-simplest-lock-free-hash-table/). |
| 12 | |
| 1 | 13 | # Prerequisites |
| 2 | 14 | |
| 3 | 15 | * CMake |