Group based job scheduling to increase the high-performance computing efficiency

DOI10.1134/S1995080220120264MaRDI QIDQ2225839zbMATH OpenOpenAlexFDO

Authors D. S. Lyakhovets, A. V. Baranov

Publication date 11 February 2021

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

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

zbMATH Keywords

supercomputerjob schedulingHPCjob groupingjob management systemsupercomputer workload

Mathematics Subject Classification ID

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

Recommendations

• Efficiency thresholds of group based job scheduling in HPC systems
• Using moldability to improve the performance of supercomputer jobs
• scientific article; zbMATH DE number 2080863
• Supercomputer Scheduling with Combined Evolutionary Techniques
• Jobs runtime forecast for JSCC RAS supercomputers using machine learning methods

Cites work

• Joint supercomputer center of the Russian Academy of Sciences: present and future
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• The third comprehensive survey on scheduling problems with setup times/costs
• The workload on parallel supercomputers: Modeling the characteristics of rigid jobs

Cited in

(5)

• Using moldability to improve the performance of supercomputer jobs
• Jobs runtime forecast for JSCC RAS supercomputers using machine learning methods
• EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
• Efficiency thresholds of group based job scheduling in HPC systems
• Scale ratio tuning of group based job scheduling in HPC systems

Describes a project that uses

Uses Software

• Slurm

This page was built for publication: Group based job scheduling to increase the high-performance computing efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225839)