Skip to Main content Skip to Navigation
New interface
Journal articles

Dynamic Fractional Resource Scheduling versus Batch Scheduling

Abstract : We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with lightweight online scheduling strategies can afford dramatic improvements in performance for executing HPC workloads.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Thursday, October 18, 2018 - 9:10:24 AM
Last modification on : Friday, November 18, 2022 - 9:25:20 AM
Long-term archiving on: : Saturday, January 19, 2019 - 12:32:46 PM


Files produced by the author(s)



Mark Lee Stillwell, Frédéric Vivien, Henri Casanova. Dynamic Fractional Resource Scheduling versus Batch Scheduling. IEEE Transactions on Parallel and Distributed Systems, 2012, 23 (3), pp.521-529. ⟨10.1109/TPDS.2011.183⟩. ⟨hal-00763373⟩



Record views


Files downloads