Dynamic packing with side constraints for datacenter resource management

DOI10.1007/978-3-319-18899-7_2MaRDI QIDQ4634970zbMATH OpenOpenAlexFDO

Authors Sophie Demassey, Fabien Hermenier, Vincent Kherbache

Publication date 13 April 2018

Published in Optimized Packings with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18899-7_2

zbMATH Keywords

constraint programmingdatacenter resource managementdynamic side constraintsvector packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• Optimal energy-efficient placement of virtual machines with divisible sizes
• Experimental and Efficient Algorithms
• Colocating tasks in data centers using a side-effects performance model
• Integrated resource allocation in heterogeneous SAN data centers

Cites work

• Resource constrained scheduling as generalized bin packing
• The load rebalancing problem

Cited in

(7)

• Colocating tasks in data centers using a side-effects performance model
• Core group placement: allocation and provisioning of heterogeneous resources
• Sandpiper: black-box and gray-box resource management for virtual machines
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• Optimizing Egalitarian Performance in the Side-Effects Model of Colocation for Data Center Resource Management
• Integrated resource allocation in heterogeneous SAN data centers
• Experimental and Efficient Algorithms

This page was built for publication: Dynamic packing with side constraints for datacenter resource management

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