International Conference on Networks · 2014 · 36 citations · 9 references
ComputingComputer EngineeringComputer SystemsCloud Performance OptimizationDesign OptimizationOptimizationCompute Resource ManagementResource AllocationResource OptimizationWorkload PlacementBin PackingBin Packing ProblemDensityPlacementPlacement AlgorithmsPlacement OptimizationVirtual Machine PlacementVirtual Machines
Effective placement of virtual machines in a cluster of physical machines is essential for optimizing the use of computational resources and reducing the probability of virtual machine reallocation. Many of previous works treat virtual machine placement as an instance of the bin packing problem, as they aim at saving energy. Alternatively, we propose an approach based on the multiple multidimensional knapsack problem, where the main concern is to maximize placement ratio. Several traditionally employed placement algorithms were re-implemented and new algorithms were defined by using such an approach. The algorithms were evaluated with respect to placement ratio, by employing a novel evaluation method that contemplates variation of computational resources heterogeneity in multiple dimensions and also variation of placement density. The experimental results showed that heterogeneity of resources among physical machines impairs the placement ratio, while heterogeneity of resources among virtual machines benefits it. It was also possible to observe that increase of density placement up to a certain point benefits the placement ratio.
9
The architecture of virtual machines
James E. Smith, Ravi Nair · Computer · 2005 · 570 citations · Full text
The Origin of the VM/370 Time-Sharing System
R. J. Creasy · IBM Journal of Research and Development · 1981 · 363 citations
Heuristics for Vector Bin Packing
Rina Panigrahy, Kunal Talwar, Lincoln Uyeda et al. · 2011 · 199 citations
The Reincarnation of Virtual Machines
Mendel Rosenblum · Queue · 2004 · 119 citations · Full text