出版社
IEEE COMPUTER SOC
DOI: 10.1109/DASC.2014.35
关键词
cloud computing; task scheduling; load balancing; genetic algorithm(GA); double-fitness
资金
- National Science Foundation for Distinguished Young Scholars of China [61225010]
- NSFC [61370198, 61370199, 61300187]
- Program for New Century Excellent Talents in University of Ministry of Education of China [NCET-10-0095]
- Fundamental Research Funds for the Central Universities [3132014215]
- China Scholarship Council Program
Task scheduling is one of the most critical issues on cloud platform. The number of users is huge and data volume is tremendous. Requests of asset sharing and reuse become more and more imperative. Efficient task scheduling mechanism should meet users' requirements and improve the resource utilization, so as to enhance the overall performance of the cloud computing environment. In order to solve this problem, considering the new characteristics of cloud computing and original adaptive genetic algorithm(AGA), a new scheduling algorithm based on double-fitness adaptive algorithm-job spanning time and load balancing genetic algorithm(JLGA) is established. This strategy not only works out a tasks scheduling sequence with shorter job and average job makespan, but also satisfies inter-nodes load balancing. At the same time, this paper adopts greedy algorithm to initialize the population, brings in variance to describe the load intensive among nodes, weights multi-fitness function. We then compare the performance of JLGA with AGA through simulations. It proves the validity of the scheduling algorithm and the effectiveness of the optimization method.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据