Plan-based job scheduling for supercomputers with shared burst buffers

DOI10.1007/978-3-030-85665-6_8MaRDI QIDQ6487186zbMATH OpenFDO

Authors Krzysztof Rzadca

Publication date 31 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85665-6_8

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10) Online algorithms; streaming algorithms (68W27)

Recommendations

• A log-linear (2 +5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
• scientific article; zbMATH DE number 2080871
• scientific article; zbMATH DE number 1966223
• Integrated scheduling: The best of both worlds.
• scientific article; zbMATH DE number 1966222

Cites work

• Computing the initial temperature of simulated annealing
• scientific article; zbMATH DE number 1966223 (Why is no real title available?)

Cited in

(1)

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

This page was built for publication: Plan-based job scheduling for supercomputers with shared burst buffers

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