Minos: Systematically Classifying Performance and Power Characteristics of GPU Workloads on HPC Clusters

As large-scale HPC compute clusters increasingly adopt accelerators such as GPUs to meet the voracious demands of modern workloads, these clusters are increasingly becoming power constrained. Given that modern applications can often temporarily exceed the power ratings of the accelerators (''power spikes''), current and future HPC systems must optimize for both power and performance together. However, this is made difficult by increasingly diverse applications, which often require bespoke optimizations to run efficiently on each cluster. Traditionally researchers overcome this problem by profiling applications on specific clusters and optimizing, but the scale, algorithmic diversity, and lack of effective tools make this challenging. To overcome these inefficiencies, we propose Minos, a systematic classification mechanism that identifies similar application characteristics via low-cost profiling for power and performance. This allows us to group similarly behaving workloads into a finite number of distinct classes and reduce the overhead of extensively profiling new workloads. For example, when predicting frequency capping behavior for a previously unseen application, Minos reduces profiling time by 89%. Moreover, across 18 popular graph analytics, HPC, HPC+ML, and ML workloads, Minos achieves a mean error of 4% for power predictions and 3% for performance predictions, significantly improving predictions over state-of-the-art approaches by 10%.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Measurement and Analysis of Computing Systems
Published
2026-05-29
DOI
https://doi.org/10.1145/3805644
Citations
1
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
20.42
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minos: Systematically Classifying Performance and Power Characteristics of GPU Workloads on HPC Clusters

Rutwik Jain, Shivaram Venkataraman, Yiwei Jiang, Matthew D. Sinclair
1 citations
Proceedings of the ACM on Measurement and Analysis of Computing Systems
Graph Theory and Algorithms
20.42
article

Minos: Systematically Classifying Performance and Power Characteristics of GPU Workloads on HPC Clusters

Rutwik Jain, Shivaram Venkataraman, Yiwei Jiang, Matthew D. Sinclair
article en
1 citations

Abstract

As large-scale HPC compute clusters increasingly adopt accelerators such as GPUs to meet the voracious demands of modern workloads, these clusters are increasingly becoming power constrained. Given that modern applications can often temporarily exceed the power ratings of the accelerators (''power spikes''), current and future HPC systems must optimize for both power and performance together. However, this is made difficult by increasingly diverse applications, which often require bespoke optimizations to run efficiently on each cluster. Traditionally researchers overcome this problem by profiling applications on specific clusters and optimizing, but the scale, algorithmic diversity, and lack of effective tools make this challenging. To overcome these inefficiencies, we propose Minos, a systematic classification mechanism that identifies similar application characteristics via low-cost profiling for power and performance. This allows us to group similarly behaving workloads into a finite number of distinct classes and reduce the overhead of extensively profiling new workloads. For example, when predicting frequency capping behavior for a previously unseen application, Minos reduces profiling time by 89%. Moreover, across 18 popular graph analytics, HPC, HPC+ML, and ML workloads, Minos achieves a mean error of 4% for power predictions and 3% for performance predictions, significantly improving predictions over state-of-the-art approaches by 10%.

Proceedings of the ACM on Measurement and Analysis of Computing SystemsVol. 10(2)
University of Wisconsin–Madison (US)
Openalex Percentile: Top 1%
Graph Theory and Algorithms
20.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.