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 computing computational biology, as well applications national security. We present our design implementation a graph theory application that supports the kernels from Scalable Synthetic Compact Applications (SSCA) benchmark suite, developed under DARPA High Productivity Computing Systems (HPCS) program. This synthetic consists four require irregular access to large, directed, weighted multi-graph. have parallel this C using POSIX thread library for commodity symmetric multiprocessors (SMPs). In paper, we primarily discuss data layout choices algorithmic issues each kernel, also execution time validation results.