Dynamic Packing with Side Constraints for Datacenter Resource Management

Sophie Demassey (), Fabien Hermenier () and Vincent Kherbache ()
Additional contact information
Sophie Demassey: PSL - Research University, CMA
Fabien Hermenier: University Nice Sophia Antipolis, CNRS, I3S, UMR 7271
Vincent Kherbache: INRIA

Chapter Chapter 2 in Optimized Packings with Applications, 2015, pp 19-35 from Springer

Abstract: 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.

Keywords: Datacenter resource management; Vector packing; Dynamic side constraints; Constraint programming (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-18899-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9783319188997

DOI: 10.1007/978-3-319-18899-7_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().