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

David A. Bader, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

60 Scopus citations

Abstract

Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing and computational biology, 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 parallel implementation of this benchmark 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.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing, HiPC 2005 - 12th International Conference, Proceedings
PublisherSpringer Verlag
Pages465-476
Number of pages12
ISBN (Print)3540309365, 9783540309369
DOIs
StatePublished - Jan 1 2005
Event12th International Conference on High Performance Computing, HiPC 2005 - Goa, India
Duration: Dec 18 2005Dec 21 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3769 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on High Performance Computing, HiPC 2005
CountryIndia
CityGoa
Period12/18/0512/21/05

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors'. Together they form a unique fingerprint.

  • Cite this

    Bader, D. A., & Madduri, K. (2005). Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings (pp. 465-476). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS). Springer Verlag. https://doi.org/10.1007/11602569_48