Comparing VM-Placement Algorithms for On-Demand Clouds
Kevin L. Mills, James J. Filliben, Christopher E. Dabrowski
Much recent research has been devoted to investigating algorithms for allocating virtual machines (VMs) to physical machines (PMs) in infrastructure clouds. Many such algorithms address distinct problems, such as initial placement, consolidation, or tradeoffs between honoring service-level agreements and constraining provider operating costs. Even where similar problems are addressed, each individual research team evaluates proposed algorithms under distinct conditions, using various techniques, often targeted to a small collection of VMs and PMs. In this paper, we describe an objective method that can be used to compare VM-placement algorithms in large clouds, covering tens of thousands of PMs and hundreds of thousands of VMs. We demonstrate our method by comparing 18 algorithms for initial VM placement in on-demand infrastructure clouds. We compare algorithms inspired by open-source code for infrastructure clouds, and by the online bin-packing literature.
3rd International Conference on Cloud Computing Technology and Science
, Filliben, J.
and Dabrowski, C.
Comparing VM-Placement Algorithms for On-Demand Clouds, 3rd International Conference on Cloud Computing Technology and Science, Athens, -1, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=909220
(Accessed May 28, 2023)