Skip to Main content Skip to Navigation

Scheduling periodic I/O access with bi-colored chains: models and algorithms

Guillaume Aupy 1 Emmanuel Jeannot 1 Nicolas Vidal 1
1 TADAAM - Topology-Aware System-Scale Data Management for High-Performance Computing
LaBRI - Laboratoire Bordelais de Recherche en Informatique, Inria Bordeaux - Sud-Ouest
Abstract : Observations show that some HPC applications periodically alternate between (i) op- erations (computations, local data-accesses) executed on the compute nodes, and (ii) I/O transfers of data and this behavior can be predicted before-hand. While the compute nodes are allocated separately to each application, the storage is shared and thus I/O access can be a bottleneck leading to contention. To tackle this issue, we design new static I/O scheduling algorithms that prescribe when each application can access the storage. To design a static algorithm, we emphasize on the periodic behavior of most applications. Scheduling the I/O volume of the different applications is repeated over time. This is critical since often the number of application runs is very high. In the following report, we develop a formal background for I/O scheduling. First, we define a model, bi-colored chain scheduling, then we go through related results existing in the literature and explore the complexity of this problem variants. Finally, to match the HPC context, we per- form experiments based on use-cases matching highly parallel applications or distributed learning framework
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Emmanuel Jeannot Connect in order to contact the contributor
Submitted on : Friday, February 15, 2019 - 4:06:17 PM
Last modification on : Friday, January 21, 2022 - 3:11:52 AM
Long-term archiving on: : Friday, May 17, 2019 - 12:03:45 PM


Files produced by the author(s)


  • HAL Id : hal-02021070, version 1



Guillaume Aupy, Emmanuel Jeannot, Nicolas Vidal. Scheduling periodic I/O access with bi-colored chains: models and algorithms. [Research Report] RR-9255, Inria. 2019, pp.25. ⟨hal-02021070⟩



Les métriques sont temporairement indisponibles