Optimal energy-efficient placement of virtual machines with divisible sizes

DOI10.1016/j.ipl.2018.06.003zbMath1458.68017OpenAlexW2807911107MaRDI QIDQ1653041

Zoltán Ádám Mann, Gergely Halácsy

Publication date: 17 July 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.06.003

zbMATH Keywords

analysis of algorithmsbin packingvirtual machinescloud computingdivisible item sizes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Distributed systems (68M14)

Related Items (1)

Approximation algorithms for a virtual machine allocation problem with finite types

Cites Work

• Unnamed Item
• Bin packing with divisible item sizes
• Fast algorithms for bin packing
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• Adaptive Resource Provisioning for the Cloud Using Online Bin Packing

This page was built for publication: Optimal energy-efficient placement of virtual machines with divisible sizes