Problem Based Benchmark Suite (2020)

Benchmarks

This is the current list of benchmarks. It includes a description for each benchmark specifying the I/O interface and the set of default input files (mostly up to date). All code can be found at pbbsbench on github.

All code is in C++. For each benchmark the we include code for generating inputs, code for testing, code for timing, a sequential implementation, and a parallel implementation. In some cases a sequential implementation is missing in the current release, but the parallel code can be compiled to run sequentially. Please read the README files.

To use a different language one can use the existing code for generating inputs and testing, but would have to implement their own code for reading and writing files and timing.

Problems on sequences

• comparisonSort: description,
• integerSort: description,

Problems on strings

• suffixArray: description,

Problems on graphs

• breadthFirstSearch: description,
• maximalIndependentSet: description,
• maximalMatching: description,
• minSpanningForest: description,
• spanningForest: description,

Problems in geometry and graphics

• convexHull: description,
• nearestNeighbors: description,
• delaunayTriangulation: description,
• delaunayRefine: description,
• nBody: description,

The full benchmark suite