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

December 2026publication date
Proposal available till 10-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Engineering (all);
Management Science and Operations Research;
Artificial Intelligence;
Software;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №7063.1 Contract №7063.2 Contract №7063.3 Contract №7063.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Observations show that some HPC applications periodically alternate between (i) operations (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 article, we develop a formal background for I/O scheduling. First, we define a model, bi-colored chain scheduling, and 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 perform experiments based on use cases matching highly parallel applications or distributed learning framework.
Keywords:
Algorithmics; Approximations; Complexity; High-performance computing

Contacts :
0