Code

psort

psort is a parallel sorting code for distributed and shared memory architectures. It uses MPI for communication, and is designed to minimize the volume of communication. It has been tested on terabyte datasets with up to 256 processors. It does not use sampling to locate splitters, and hence no prior knowledge of the probability distribution is required. It provides several options for splitting, sequential sorting and merging. A sample sort is also included. The code is available freely for personal non-commercial and research use.

cSSCA

SSCA#2 is a part of the Synthetic Scalable Concise Applications benchmark suite. The SSCAs are a new set of benchmarks designed by the DARPA/DOE High Productivity Computer Systems program to complement existing benchmarks.

It is a graph analysis benchmark comprising of a data generator and 4 kernels which operate on the graph. The benchmark is designed to have very little locality so that the memory subsystems are tested. In case of a parallel implementation, the non-locality causes a lot of remote memory lookups.

cSSCA#2 is a concise implementation of SSCA#2 in MATLAB and Star-P - a parallel implementation of the matlab programming language.

Acid

Acid is a viewer for productivity data gathered as part of the HPCS program. You can view the entire productivity data online. Both the code and data are available for download. Email me if you are interested.