publication . Preprint . 2010

Optimal Placement Algorithms for Virtual Machines

Bellur, Umesh; Rao, Chetan S; SD, Madhu Kumar;
Open Access English
  • Published: 23 Nov 2010
Cloud computing provides a computing platform for the users to meet their demands in an efficient, cost-effective way. Virtualization technologies are used in the clouds to aid the efficient usage of hardware. Virtual machines (VMs) are utilized to satisfy the user needs and are placed on physical machines (PMs) of the cloud for effective usage of hardware resources and electricity in the cloud. Optimizing the number of PMs used helps in cutting down the power consumption by a substantial amount. In this paper, we present an optimal technique to map virtual machines to physical machines (nodes) such that the number of required nodes is minimized. We provide two ...
free text keywords: Computer Science - Distributed, Parallel, and Cluster Computing, C.2.4, G.1.6
Download from
26 references, page 1 of 2

[3] Rackspace Cloud.

[4] lp-solve.

[5] N. Bobroff, A. Kochut, and K. Beaty. Dynamic Placement of Virtual Machines for Managing SLA Violations. IM '07: Proceedings of the 10th IEEE Symposium on Integrated Management, IEEE Computer Society, Washington, DC, USA (2007). [OpenAIRE]

[6] Nikhil Bansal, Alberto Caprara and Maxim Sviridenko. Improved approximation algorithms for multidimensional bin packing problems. FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA (2006) 697-708

[7] M. Cardosa, M. R. Korupolu, and A. Singh. Shares and Utilities based Power Consolidation in Virtualized Server Environments. IM '09: Proceedings of IFIP/IEEE Integrated Network Management, (2009).

[8] Nikhil Bansal, Jos R. Correa, Claire Kenyon and Maxim Sviridenko. Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1), (2006) 31-49

[9] R. Bianchini and R. Rajamony. Power and energy management for server systems. IEEE Computer. 37, (2004) 2004.

[10] Alberto Caprara. Packing 2-Dimensional Bins in Harmony. FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA (2002) 490-499

[11] Alberto Caprara and Paolo Toth. Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Appl. Math. 111(3), (2001) 231-262

[12] Chandra Chekuri and Sanjeev Khanna. On multi-dimensional packing problems. SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Baltimore, Maryland, USA (1999) 185-194

[13] George Bernard Dantzig and Mukund Narain Thapa. Linear Programming: Theory and extensions, Springer-Verlag (2003).

[14] Wenceslas Fernandez de la Vega and George S. Lueker. Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4), (1981) 349-355

[15] M.R. Garey, R.L. Graham and D.S. Johnson. Resource Constrained Scheduling as Generalized Bin Packing. J. Combinatorical Theory 21(3), (1976) 257-298 [OpenAIRE]

[16] L. Grit, D. Irwin, A. Yumerefendi. and J. Chase. Virtual Machine Hosting for Networked Clusters: Building the Foundations for Autonomic Orchestration. VTDC '06: Proceedings of IEEE International Workshop on Virtualization Technology in Distributed Computing, IEEE Computer Society, Washington, DC, USA (2006).

[17] Michael R. Garey and David S. Johnson. Computers and Intractability: A guide to the Theory of NP-Completeness, W.H. Freeman and Co. (1976).

26 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue