Comparing VM-Placement Algorithms for On-Demand Clouds
- 1 November 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2011 IEEE Third International Conference on Cloud Computing Technology and Science
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
This publication has 17 references indexed in Scilit:
- An Efficient Sensitivity Analysis Method for Large Cloud SimulationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- On Theory of VM Placement: Anomalies in Existing Methodologies and Their Mitigation Using a Novel Vector Based ApproachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Effective VM sizing in virtualized data centersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Predicting Macroscopic Dynamics in Large Distributed Systems: Part IPublished by ASME International ,2011
- Resource allocation across multiple cloud data centresPublished by Association for Computing Machinery (ACM) ,2010
- Decision Model for Cloud Computing under SLA ConstraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Applying Double-Sided Combinational Auctions to Resource Allocation in Cloud ComputingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Runtime Demand Estimation for effective dynamic resource managementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- New Bounds for Variable-Sized Online Bin PackingSIAM Journal on Computing, 2003
- Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDIIEEE Internet Computing, 2002