Problem Based Benchmark Suite
Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri and Kanat Tangwongsan.
Brief Announcement: The Problem Based Benchmark Suite
Proc. ACM Symposium on Parallelism in Algorithms and Architecture (SPAA), June 2012.
A brief description of the goals of the benchmarks. This is the paper that
should be cited.
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, and Julian Shun.
Internally Deterministic Parallel Algorithms Can Be Fast.
Proc. ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), February 2012.
This paper uses the benchmarks to study the performance of deterministic implementations. All the benchmark code used in the paper is included in the benchmarks.
last modified 15:59, 23 May 2012
This project has been funded by the following sources:
Intel Labs Academic Research Office for the Parallel Algorithms for Non-Numeric Computing Program,
National Science Foundation, and