Efficiency thresholds of group based job scheduling in HPC systems

DOI10.1134/S1995080222130261zbMath1506.68011OpenAlexW4319779652MaRDI QIDQ2688503

D. S. Lyakhovets, A. V. Baranov

Publication date: 3 March 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080222130261

zbMATH Keywords

supercomputerjob schedulingHPCjob groupingjob management systemsupercomputer workloadinitialization share threshold

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• OptorSim
• WorkflowSim

Cites Work

• Unnamed Item
• The workload on parallel supercomputers: Modeling the characteristics of rigid jobs
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• Group based job scheduling to increase the high-performance computing efficiency
• Joint supercomputer center of the Russian Academy of Sciences: present and future
• ``Endless workload analysis of large-scale supercomputers

This page was built for publication: Efficiency thresholds of group based job scheduling in HPC systems