Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors

Abstract

Graph theoretic problems are representative of fundamental computations in tra-ditional and emerging scientic disciplines like scientic computing and computational biology, as well as applications in national security. We present our design and im-plementation of a graph theory application that supports the kernels from the Scal-able Synthetic Compact Applications (SSCA) benchmark suite, developed under the DARPA High Productivity Computing Systems (HPCS) program. This synthetic benchmark consists of four kernels that require irregular access to a large, directed, weighted multi-graph. We have developed a parallel implementation of this bench-mark in C using the POSIX thread library for commodity symmetric multiprocessors (SMPs). In this paper, we primarily discuss the data layout choices and algorithmic design issues for each kernel, and also present execution time and benchmark validation results.