DocumentCode :
2183011
Title :
An Efficient Method for Maximizing Total Weights in Virtual Machines Allocation
Author :
Wenhong Tian ; Jun Cao ; Xingyang Wang ; Minxian Xu ; Yu Chen
Author_Institution :
Univ. of Electron. Sci. & Technol. of China Chengdu, Chengdu, China
fYear :
2013
fDate :
16-19 Dec. 2013
Firstpage :
470
Lastpage :
473
Abstract :
When allocating virtual machines (VMs) in data centers, weights such as profits and other benefits are associated with all VMs. This paper considers maximizing the total weight in VMs allocation. As virtualization widely adopted in Cloud computing, requests may only consume part of the total capacity of a single hardware resource (for example a physical machine), this requires a new model for maximizing the total weight. In this paper, for the first time we model this problem as shared interval scheduling for capacity proportional weight and propose an exact efficient algorithm for it with computational complexity O(n2) where n is the number of jobs. The proposed method has good scalability and can be applied to maximize the total weight or related metrics in cloud computing.
Keywords :
cloud computing; computational complexity; resource allocation; scheduling; virtual machines; VMs; capacity proportional weight; cloud computing; computational complexity; data centers; exact efficient algorithm; shared interval scheduling; single hardware resource; total weight maximization; virtual machine allocation; Cloud computing; Heuristic algorithms; Optimal scheduling; Resource management; Scheduling; Scheduling algorithms; Virtual machining; cloud computing; maximize the total weight; virtual machine allocation; weighted interval scheduling; weighted interval scheduling with capacity sharing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cloud Computing and Big Data (CloudCom-Asia), 2013 International Conference on
Conference_Location :
Fuzhou
Print_ISBN :
978-1-4799-2829-3
Type :
conf
DOI :
10.1109/CLOUDCOM-ASIA.2013.36
Filename :
6821034
Link To Document :
بازگشت