The new version of the benchmarks is available on github at

"https://github.com/cmuparlay/pbbsbench".

- Are representative of a reasonably wide variety of real-world tasks
- The problem can be defined concisely
- Are simple enough that reasonably efficient solutions can be implemented in around 500 lines of code, but not trivial microbencharks
- Have outputs that can be easily tested for correctness and possibly quality

- The definition of the problems in terms of their function specification (the input they take and the required output given the input).
- A set of input distributions on which to test and time implementations.
- Input generators for each of the input distributions.
- Output testers for testing the correctness and/or quality of the output
- A sequential and a parallel base implementation for each problem (in some cases the sequential implementation is just the parallel one on a single processor).
- A repository of implementations.

- Comparison sort (SORT)
- Integer sort (ISORT)
- Suffix Array (SA)
- Breadth First Search Tree (BFS)
- Maximal Independent Set (MIS)
- Maximal Matching (MIS)
- Minimum Spanning Forest (MSF)
- Spanning Forest (SF)
- Convex Hull (CH)
- Delaunay Triangulation (DT)
- Delaunay Refinement (DR)
- K-Nearest Neighbors (KNN)
- Nbody Forces (NBODY)

last modified 13:19, 23 Jul 2021

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

IBM Research.