SPEC ACCEL Benchmark Description File

Benchmark Name


Benchmark Author

University of Virginia

Benchmark Program General Category

Graph Traversal, Search

Benchmark Description

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.

Input Description

The benchmark accepts on the command line the name of the file with the data and the name of the test parameters.

Output Description

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.

Programming Language


Known portability issues




[1] J. Fix, A. Wilkes and K. Skadron. "Accelerating Braided B+ Tree Searches on a GPU with CUDA." ACM Transactions on Database Systems. 2009.

Last Updated: February 3, 2014