Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors

Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and bioinformatics, as well as applications in national security. We present our design and implementation of a graph theory application that supports the kernels from the Scalable 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 portable parallel implementation of this benchmark in C using POSIX thread libraries 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.

• Type: Conference
• Year: 2005
• Where: HIPC
• Authors: David A. Bader, Kamesh Madduri
• Keywords: Benchmark Suite, Graph Theoretic Problems, HIPC 2005, Synthetic Benchmark