Making Control in High Performance Computing for Overload Avoidance Adaptive in Time and Job Size

The feedback control of High-Performance Computing (HPC) has been explored as an application area of Control Theory, because of the high variability involved in their resource management. A regulation mechanism can allow to soundly automate the injection of small flexible jobs in a cluster. A trade-off is needed, to fill up the cluster’s computing capacity while avoiding overload of e.g., the file server.In this work, we describe new results in this context, where the overload avoidance controller is made adaptive to the jobs’ size, that is a time-varying unknown parameter. To do so, the original PI controller is enhanced with an online estimation algorithm that allows the controller to adapt to various working conditions, to avoid performance degradation. Parallel and robust estimation algorithms are designed, tackling the challenges of bursting and noise in the system. Validation and evaluation of the adaptive controller are performed on a large-scale experimental HPC platform, showing higher robustness than the state-of-the-art in highly varying conditions. Reproducible analysis are available at doi:10.5281/zenodo.11961696.

Authors

Institutions

Publication Details

Published
2024-08-21
DOI
https://doi.org/10.1109/ccta60707.2024.10666583
Citations
2
Primary Topic
Real-Time Systems Scheduling
Type
article
Field-Weighted Citation Impact
0.98
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Making Control in High Performance Computing for Overload Avoidance Adaptive in Time and Job Size

Raphaël Bleuse, Quentin Guilloteau, Bogdan Robu, Sophie Cerf et al.
2 citations
Real-Time Systems Scheduling
0.98
article

Making Control in High Performance Computing for Overload Avoidance Adaptive in Time and Job Size

Raphaël Bleuse, Quentin Guilloteau, Bogdan Robu, Sophie Cerf, Rosa Pagano, Éric Rutten
article en
2 citations

Abstract

The feedback control of High-Performance Computing (HPC) has been explored as an application area of Control Theory, because of the high variability involved in their resource management. A regulation mechanism can allow to soundly automate the injection of small flexible jobs in a cluster. A trade-off is needed, to fill up the cluster’s computing capacity while avoiding overload of e.g., the file server.In this work, we describe new results in this context, where the overload avoidance controller is made adaptive to the jobs’ size, that is a time-varying unknown parameter. To do so, the original PI controller is enhanced with an online estimation algorithm that allows the controller to adapt to various working conditions, to avoid performance degradation. Parallel and robust estimation algorithms are designed, tackling the challenges of bursting and noise in the system. Validation and evaluation of the adaptive controller are performed on a large-scale experimental HPC platform, showing higher robustness than the state-of-the-art in highly varying conditions. Reproducible analysis are available at doi:10.5281/zenodo.11961696.

Institut polytechnique de Grenoble (FR), Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), University of Basel (CH), Université de Lille (FR), Centre Inria de l'Université Grenoble Alpes (FR), Laboratoire d'Informatique de Grenoble (FR), Centre de Recherche en Informatique (FR), GIPSA-Lab (FR), Laboratoires Spiral (France) (FR), Centre Inria de l'Université de Lille (FR), École Centrale de Lille (FR), Université Grenoble Alpes (FR)
Openalex Percentile: Top 26%
Real-Time Systems Scheduling
0.98
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.