Dynamic Packing with Side Constraints for Datacenter Resource Management

Abstract : Resource management in datacenters involves assigning virtual machines with changing resource demands to physical machines with changing capacities. Recurrently, the changes invalidate the assignment and the resource manager recomputes it at runtime. The assignment is also subject to changing restrictions expressing a variety of user requirements. The present chapter surveys this application of vector packing—called the VM reassignment problem—with an insight into its dynamic and heterogeneous nature. We advocate flexibility to answer these issues and present BtrPlace, a flexible and scalable heuristic solution based on Constraint Programming.
Type de document :
Chapitre d'ouvrage
Giorgio Fasano, János D. Pintér. Optimized Packings with Applications, 105, Springer International Publishing, pp.19-35, 2015, Springer Optimization and Its Applications, 978-3-319-18899-7. <10.1007/978-3-319-18899-7_2>


https://hal-mines-paristech.archives-ouvertes.fr/hal-01224870
Contributeur : Brigitte Hanot <>
Soumis le : jeudi 5 novembre 2015 - 11:20:40
Dernière modification le : mercredi 28 septembre 2016 - 16:12:38

Identifiants

Collections

Citation

Sophie Demassey, Fabien Hermenier, Vincent Kherbache. Dynamic Packing with Side Constraints for Datacenter Resource Management. Giorgio Fasano, János D. Pintér. Optimized Packings with Applications, 105, Springer International Publishing, pp.19-35, 2015, Springer Optimization and Its Applications, 978-3-319-18899-7. <10.1007/978-3-319-18899-7_2>. <hal-01224870>

Partager

Métriques

Consultations de la notice

181