ALCF MPI Benchmark Suite: ALCF MPI Benchmark Suite, which is designed to benchmark and measure several basic routines, such as messaging rate, ping-pong, aggregate off-node bandwidth, bi-section bandwidth, and collective operations.
Contact: Vitali Morozov
Download: ALCF_MPI_Benchmark_v1.01.BGQ.tar.bz2

BigSort Benchmark: The BigSort benchmark sorts a large number of 64-bit integers (from 0 to T) in parallel. In particular, the total size of the data set can exceed the aggregated memory size of all nodes. The goal is to exercise and study a computer system’s memory hierarchy performance when it comes to big data management. The emphasis here is IO, all-to-all communication, and integer operations.
Full Summary: BigSort_Summary_v1.1
Contact: Venkat Vishwanath
Download: BigSort-v1_1.tar.bz2

HACC I/O: HACC I/O  benchmark evaluates the performance of the I/O system on supercomputers for the Hardware Accelerated Cosmology Code (HACC) simulation.  The HACC framework uses N-body techniques to simulate the formation of structure in collisionless fluids under the influence of gravity in an expanding universe.  The HACC I/O benchmark capture the I/O patterns of the HACC simulation code. This includes the checkpoint and restarts as well as the analysis outputs produced by the simulation.  It also captures the various I/O interfaces used in HACC, namely, POSIX I/O, MPI Collective I/O and MPI Independent I/O. Additionally, the benchmark can either write out a single shared file, file per process, and a file per group of processes (partition).
Contact: Venkat Vishwanath
Download: HACC_IO.tar
Summary: HACC I/O

High-Performance CRC64 Library: This library implements a high-performance computation of the 64-bit cyclic-redundancy check (CRC) of arbitrary input data. This implementation requires only a C99 compiler, but has been tuned for the IBM BG/Q supercomputer, and can take advantage of a compiler's OpenMP support to compute the CRC in parallel on multiple cores.
Contact: Hal Finkel
Summary and Download: hpcrc64

KMI HASH Benchmark: KMI, K-mer Matching Interface, is a domain-specific library for genome assembly and mapping analysis applications. Genome assembly and mapping fundamentally rely on efficient matching of k-mers (which are short snippets of DNA sequences) on distributed memory machines. One purpose of this data-centric benchmark is to evaluate the performance of the architecture integer operations, specifically for hashing, and for memory-intensive genomics applications.
Full Summary: KMI_Summary_v1.1

Contact: Venkat Vishwanath
Download: KMI_HASH_CORAL_tar.gz

MonEQ: Monitoring and Profiling Power and Energy Consumption on the Blue Gene/Q Supercomputer
Contact: Venkat Vishwanath
Download: moneq_bgq-public_release_v1.1