Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

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.
Proceedings Title
3rd International Conference on Cloud Computing Technology and Science
Conference Dates
November 29-December 1, 2011
Conference Location
Conference Title
IEEE CloudCom 2011


cloud computing, resource allocation, simulation


Mills, K. , Filliben, J. and Dabrowski, C. (2011), Comparing VM-Placement Algorithms for On-Demand Clouds, 3rd International Conference on Cloud Computing Technology and Science, Athens, -1, [online], (Accessed July 25, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created November 29, 2011, Updated February 19, 2017