Metraipolis › archive › dc_51733767cd45
How Much Does Submitting a Burst of Jobs Impact Waiting Time? An Analysis of the Jean Zay Workload Trace — arXiv:2610.11703
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11703
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:27:52.830Z
- SHA-256 of the archived text
07deea7538753e75a031a35c1053edd79f5ee8b82c9e2a7629c5d347f71c53fb- Stable URL of this page
https://metraipolis.com/documento/dc_51733767cd45
How to cite
How Much Does Submitting a Burst of Jobs Impact Waiting Time? An Analysis of the Jean Zay Workload Trace — arXiv:2610.11703 — arXiv (en), https://arxiv.org/abs/2610.11703 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_51733767cd45 (Metraipolis archive dc_51733767cd45, sha256 07deea7538753e75a031a35c1053edd79f5ee8b82c9e2a7629c5d347f71c53fb)
BibTeX
@misc{dc51733767cd45,
title = {How Much Does Submitting a Burst of Jobs Impact Waiting Time? An Analysis of the Jean Zay Workload Trace — arXiv:2610.11703},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11703},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_51733767cd45; sha256 07deea7538753e75a031a35c1053edd79f5ee8b82c9e2a7629c5d347f71c53fb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11703. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper examines job waiting times on the Jean Zay supercomputer at IDRIS (Institut du D{é}veloppement et des Ressources en Informatique Scientifique this http URL ), driven by the need to improve scheduling strategies for crossfacility scientific workflows. Drawing on large workload traces, we show that job waiting times are not independent of one another but are instead correlated through job bursts-batches of identical jobs submitted together, also called ``flurries''. We introduce a method for quantifying the effect of these bursts on waiting times, and find a strong Pearson correlation between waiting time and a job's rank within its burst. This correlation is above 0.8 for more than 40% of the jobs. We further derive an exact formula for the Slurm fairshare factor based on a convolution product, showing that the burst penalty operates on a much shorter timescale than fairshare itself-pointing to a distinct throttling mechanism specifically targeting bulk submissions. Once burst effects are accounted for, we use Welch's t-test to find that partition occupancy and number of requested cores have a significant effect on waiting time, though the effect is not significant for all partitions.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.AP, nuovi lavori del giorno).
Categorie arXiv: Applications (stat.AP).
Pagina del lavoro: https://arxiv.org/abs/2610.11703 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:52:01.597Z dalla pagina https://arxiv.org/list/stat.AP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).