Papers › The GAP Benchmark Suite

The GAP Benchmark Suite

14 Aug 2015arXiv:1508.03619links table onlyarchive 2025-07-28

Scott Beamer, Krste Asanović, David Patterson

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a graph processing benchmark suite with the goal of helping to standardize graph processing evaluations. Fewer differences between graph processing evaluations will make it easier to compare different research efforts and quantify improvements. The benchmark not only specifies graph 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 outperform them to demonstrate an improvement. The input graphs are sized appropriately for shared memory platforms, but any implementation on any platform that conforms to the benchmark's specifications could be compared. 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.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

sbeamer/gapbs officialmentioned in papermentioned on GitHubNOASSERTIONSyntology: not harvested report
aaronrhuang/bfs mentioned on GitHubNOASSERTIONSyntology: not harvested report
atmughrabi/OpenGraph mentioned on GitHubBSD-2-ClauseSyntology: not harvested report
atmughrabi/OpenGraphSim mentioned on GitHubBSD-2-ClauseSyntology: not harvested report
trinhhe/BA mentioned on GitHubNOASSERTIONSyntology: not harvested report
tugsbayasgalan/experiment mentioned on GitHubNOASSERTIONSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Datasets

Introduced by this paper, per the archive.

GAP

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections