University of Virginia
Graph Traversal, Search
Traversing B+ Trees in parallel on the GPU, avoiding the overhead of selecting the entire table to transform it into row-column format and leveraging the logarithmic nature of tree searches.
The benchmark accepts on the command line the name of the file with the data and the name of the test parameters.
Output prints out the start and lengths for the range test, and prints out the answer for the K test.
The output file bplustree.out contains detailed timing information about the run. It also shows which device was selected along with what devices where available to OpenCL.