DocumentCode
2683205
Title
A Cloud Computing Resource Scheduling Policy Based on Genetic Algorithm with Multiple Fitness
Author
Chen, Shi ; Wu, Jie ; Lu, Zhihui
Author_Institution
Sch. of Comput. Sci. & Technol., Fudan Univ., Shanghai, China
fYear
2012
fDate
27-29 Oct. 2012
Firstpage
177
Lastpage
184
Abstract
Under the cloud computing environment of IaaS(Infrastructure as a Service), due to the expansion of system scale and virtual machines´ migrations, etc, it is easy to cause some problems like fragmentation of physical resources, low utilization of resources. The consequences lead to high energy consumption within an Internet Data center. In this paper, we propose a pre-migration strategy based on three load dimensions: CPU utilization, network throughput, disk I/O rate, which are considered complementary in the algorithm. In order to get an approximately optimal solution, we adopt the hybrid genetic algorithm combined with knapsack problem with multiple fitness and experiments are conducted to verify the effectiveness of the algorithm. The result of the experiments shows that the algorithm can effectively achieve the goal of raising resources´ utilization and lowering energy consumption under cloud computing environment.
Keywords
cloud computing; energy consumption; genetic algorithms; knapsack problems; scheduling; virtual machines; CPU utilization; IaaS; Internet datacenter; cloud computing resource scheduling policy; disk IO rate; energy consumption; genetic algorithm; infrastructure as a service; knapsack problem; multiple fitness; network throughput; pre-migration strategy; virtual machine migrations; Algorithm design and analysis; Biological cells; Cloud computing; Genetic algorithms; Job shop scheduling; Virtual machining; Cloud Computing; Genetic Algorithm; Live Migration; Load Complementation; Resource Scheduling; Virtual Machine;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4673-4873-7
Type
conf
DOI
10.1109/CIT.2012.56
Filename
6391895
Link To Document