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

56 Citations (Scopus)

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
Pages465-476
Number of pages12
Volume3769 LNCS
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Benchmarking
Multiprocessor
Productivity
Benchmark
Computing
Graph in graph theory
kernel
Natural sciences computing
National security
Graph theory
Security Measures
Scientific Computing
Multigraph
Computational Biology
Parallel Implementation
Thread
Execution Time
Libraries
Layout
Irregular

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

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 (Vol. 3769 LNCS, pp. 465-476). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).
Bader, David A. ; Madduri, Kamesh. / Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. Vol. 3769 LNCS 2005. pp. 465-476 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1c3d3f0758734601a4233827db6e5aa1,
title = "Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors",
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.",
author = "Bader, {David A.} and Kamesh Madduri",
year = "2005",
language = "English (US)",
isbn = "3540309365",
volume = "3769 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "465--476",
booktitle = "High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings",

}

Bader, DA & 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. vol. 3769 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3769 LNCS, pp. 465-476, 12th International Conference on High Performance Computing, HiPC 2005, Goa, India, 12/18/05.

Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. / Bader, David A.; Madduri, Kamesh.

High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. Vol. 3769 LNCS 2005. p. 465-476 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).

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

TY - GEN

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

AU - Bader, David A.

AU - Madduri, Kamesh

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646744243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646744243&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540309365

SN - 9783540309369

VL - 3769 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 465

EP - 476

BT - High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings

ER -

Bader DA, Madduri K. Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. Vol. 3769 LNCS. 2005. p. 465-476. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).