The GAP Benchmark Suite

We present a graph processing benchmark suite targeting shared memory platforms. The goal of this benchmark is to help standardize graph processing evaluations, making it easier to compare different research efforts and quantify improvements. The benchmark not only specifies kernels, input graphs, and evaluation methodologies, but it also provides optimized baseline implementations. These baseline implementations are representative of state-of-the-art performance, and thus new contributions should beat their performance to demonstrate an improvement. This benchmark suite can be used in a variety of settings. Graph framework developers can demonstrate the generality of their programming model by implementing all of the benchmark's kernels and delivering competitive performance on all of the benchmark's graphs. Algorithm designers can use the input graphs and the baseline implementations to demonstrate their contribution. Platform designers and performance analysts can use the suite as a workload representative of graph processing.