A Deep Look into the Temporal I/O Behavior of HPC Applications

The increasing gap between compute and I/O speeds in high-performance computing (HPC) systems imposes the need for techniques to improve applications' I/O performance. Such techniques must rely on assumptions about I/O behavior in order to efficiently allocate I/O resources such as burst buffers, to schedule accesses to the shared parallel file system or to delay certain applications at the batch scheduler level to prevent contention, for instance. In this paper, we verify these common assumptions about I/O behavior, specifically about temporal behavior, using over 440,000 traces from real HPC systems. By combining traces from diverse systems, we characterize the behaviors observed in real HPC workloads. Among other findings, we show that I/O activity tends to last for a few seconds, and that periodic jobs are the minority, but responsible for a large portion of the I/O time. Furthermore, we make projections for the expected improvement yielded by popular approaches for I/O performance improvement. Our work provides valuable insights to everyone working to alleviate the I/O bottleneck in HPC.

Authors

Institutions

Publication Details

Published
2025-06-03
DOI
https://doi.org/10.1109/ipdps64566.2025.00072
Citations
3
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
4.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Deep Look into the Temporal I/O Behavior of HPC Applications

Julien Monniot, Ahmad Tarraf, Luan Teylo, Carla Osthoff et al.
3 citations
Advanced Data Storage Technologies
4.46
article

A Deep Look into the Temporal I/O Behavior of HPC Applications

Julien Monniot, Ahmad Tarraf, Luan Teylo, Carla Osthoff, Francieli Zanon Boito, André Ramos Carneiro, François Tessier, Mihail Popov, Jakob Luettgau, Theo Jolivel
article en
3 citations

Abstract

The increasing gap between compute and I/O speeds in high-performance computing (HPC) systems imposes the need for techniques to improve applications' I/O performance. Such techniques must rely on assumptions about I/O behavior in order to efficiently allocate I/O resources such as burst buffers, to schedule accesses to the shared parallel file system or to delay certain applications at the batch scheduler level to prevent contention, for instance. In this paper, we verify these common assumptions about I/O behavior, specifically about temporal behavior, using over 440,000 traces from real HPC systems. By combining traces from diverse systems, we characterize the behaviors observed in real HPC workloads. Among other findings, we show that I/O activity tends to last for a few seconds, and that periodic jobs are the minority, but responsible for a large portion of the I/O time. Furthermore, we make projections for the expected improvement yielded by popular approaches for I/O performance improvement. Our work provides valuable insights to everyone working to alleviate the I/O bottleneck in HPC.

Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Université de Bordeaux (FR), Institut de Recherche en Informatique et Systèmes Aléatoires (FR), Technische Universität Darmstadt (DE), Laboratoire Bordelais de Recherche en Informatique (FR), Laboratório Nacional de Computação Científica (BR), Institut Polytechnique de Bordeaux (FR), Université de Rennes (FR)
U.S. Department of Energy, Office of Science, Argonne National Laboratory
Openalex Percentile: Top 7%
Advanced Data Storage Technologies
4.46
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.