Optimal energy-efficient placement of virtual machines with divisible sizes
From MaRDI portal
Publication:1653041
Recommendations
- Virtual machine placement for minimizing connection cost in data center networks
- Multi-objective temporal bin packing problem: an application in cloud computing
- A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
- Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
Cites work
- Adaptive Resource Provisioning for the Cloud Using Online Bin Packing
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Bin packing with divisible item sizes
- Fast algorithms for bin packing
- scientific article; zbMATH DE number 6678949 (Why is no real title available?)
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
Cited in
(9)- Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics
- Virtual machine placement for minimizing connection cost in data center networks
- Core group placement: allocation and provisioning of heterogeneous resources
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- Multi-objective temporal bin packing problem: an application in cloud computing
- Approximation algorithms for a virtual machine allocation problem with finite types
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
- Dynamic packing with side constraints for datacenter resource management
This page was built for publication: Optimal energy-efficient placement of virtual machines with divisible sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653041)