• DocumentCode
    3063191
  • Title

    Comparing VM-Placement Algorithms for On-Demand Clouds

  • Author

    Mills, K. ; Filliben, J. ; Dabrowski, C.

  • Author_Institution
    Inf. Technol. Lab., NIST, Gaithersburg, MD, USA
  • fYear
    2011
  • fDate
    Nov. 29 2011-Dec. 1 2011
  • Firstpage
    91
  • Lastpage
    98
  • Abstract
    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.
  • Keywords
    cloud computing; public domain software; virtual machines; PM; VM placement algorithms; on demand infrastructure clouds; online bin packing; open source code; physical machines; virtual machines; Algorithm design and analysis; Analysis of variance; Cloud computing; Clustering algorithms; Computational modeling; Peer to peer computing; cloud computing; resource allocation; simulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cloud Computing Technology and Science (CloudCom), 2011 IEEE Third International Conference on
  • Conference_Location
    Athens
  • Print_ISBN
    978-1-4673-0090-2
  • Type

    conf

  • DOI
    10.1109/CloudCom.2011.22
  • Filename
    6133131