arrow
Return

Parallel sorting algorithm classification: is manual instrumentation necessary?

delete2025-09-27
delete0
PRE
AI
M
Michael McKinsey
D
Dewi Yokelson
S
Stephanie Brink
T
Tom Scogland
O
Olga Pearce
DOI:10.1016/j.future.2025.108170delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. We demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Journal

F
Future Generation Computer Systems
IF:
0
Papers:
642
Citations:
0

Organization

L
Lawrence Livermore National Laboratory
Scholars:
6.0K
Papers: 3.8K
Citations: 9