



















Abstract:This work extends a framework for predicting the performance of High-Performance Computing (HPC) workloads using Machine Learning (ML). A common limitation in performance modeling is the restricted number of hardware counters that can be collected simultaneously. To address this, we propose a heuristic-based methodology to merge execution traces from multiple runs, each instrumented with a different set of hardware counters. Our approach matches computation bursts across executions by analyzing MPI structure, timing, and communication patterns. This process enables the construction of a unified dataset that includes a wider set of hardware features without relying on multiplexing. The output is a new synthetic trace with all merged counters, which can be used both for HPC performance prediction and for conventional performance analysis. The methodology has been validated on MareNostrum5 machine with a range of kernels and real applications. Results show that the merged counters maintain acceptable accuracy depending on the application, and can be directly used to train ML models on a richer feature space without prior counter selection.
| Subjects: | Performance (cs.PF); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.15832 [cs.PF] |
| (or arXiv:2605.15832v1 [cs.PF] for this version) | |
| https://doi.org/10.48550/arXiv.2605.15832 arXiv-issued DOI via DataCite (pending registration) |
From: Marc Clascà Ramírez [view email]
[v1]
Fri, 15 May 2026 10:36:15 UTC (2,410 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。