Contiguity and Locality in Backfilling Scheduling

Abstract : We consider the classical First Come First Served / backfilling algorithm which is commonly used in actual batch schedulers. As HPC platforms grow in size and complexity, an interesting question is how to enhance this algorithm in order to improve global performance by reducing the overall amount of communications. In this direction, we are interested in studying the impact of contiguity and locality allocation constraints on the behavior of batch scheduler. We provide a theoretical analysis of the cost of enforcing contiguity and locality properties. More specifically, we show that both properties do not impose strong limit on achievable makespan performance while comparing feasible optimal solutions under different settings; we describe here the existing results on this topic and complete them with all combinations of constraints. We also propose a range of different allocation algorithms for backfilling by choosing between a strict or a soft enforcing of locality and contiguity. Our approach is validated through an extensive series of simulations based on batch scheduler traces. Experiments show that our algorithms do not increase the makespan in average when comparing to actual practices. Interestingly, we observe that enforcing contiguity efficiently improves locality.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01230294
Contributor : Grégory Mounié <>
Submitted on : Wednesday, November 18, 2015 - 11:14:29 AM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM

Identifiers

Collections

INRIA | UGA | LIG

Citation

Giorgio Lucarelli, Fernando Machado Mendonca, Denis Trystram, Frédéric Wagner. Contiguity and Locality in Backfilling Scheduling. CCGrid 2015 - 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2015, Shenzhen, China. pp.586--595, ⟨10.1109/CCGrid.2015.143⟩. ⟨hal-01230294⟩

Share

Metrics

Record views

300