As part of its 25^th anniversary celebration, a HiPC committee reviewed all of the top-ranked paper submissions accepted by the conference during the past 25 years. “The committee voted and identified the seven most impactful papers,” said HiPC Steering Chair Viktor Prasanna.

Bader’s winning paper, Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors, was published at HiPC in 2005.

In the paper, Bader and Pennsylvania State University Associate Professor Kamesh Madduri, presented the design and implementation of a graph theory application that supports a synthetic benchmark suite dubbed the Scalable Synthetic Compact Applications (SSCA). This seminal paper is often cited as the earliest data science benchmark on scalable graph analysis.  

The SSCA suite was developed under the Defense Advanced Research Projects Agency High Productivity Computing Systems (HPCS) program to reassess the way performance, programmability, portability, robustness, and productivity are defined and measured in high-performance computing domains.

“These benchmarks represent important computational and data science kernels in solving real-world problems. This research has stood the test of time and accelerated the design of high-performance computers capable of solving today’s grand challenges in machine learning, healthcare informatics, and national security,” said Bader.