Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

2013 ◽  
Vol 347-350 ◽  
pp. 2426-2429 ◽  
Author(s):  
Jun Wei Ge ◽  
Yong Sheng Yuan

Use genetic algorithm for task allocation and scheduling has get more and more scholars' attention. How to reasonable use of computing resources make the total and average time of complete the task shorter and cost smaller is an important issue. The paper presents a genetic algorithm consider total task completion time, average task completion time and cost constraint. Compared with algorithm that only consider cost constraint (CGA) and adaptive algorithm that only consider total task completion time by the simulation experiment. Experimental results show that this algorithm is a more effective task scheduling algorithm in the cloud computing environment.


Author(s):  
Honglin Zhang ◽  
Yaohua Wu ◽  
Zaixing Sun

AbstractIn cloud computing, task scheduling and resource allocation are the two core issues of the IaaS layer. Efficient task scheduling algorithm can improve the matching efficiency between tasks and resources. In this paper, an enhanced heterogeneous earliest finish time based on rule (EHEFT-R) task scheduling algorithm is proposed to optimize task execution efficiency, quality of service (QoS) and energy consumption. In EHEFT-R, ordering rules based on priority constraints are used to optimize the quality of the initial solution, and the enhanced heterogeneous earliest finish time (HEFT) algorithm is used to ensure the global performance of the solution space. Simulation experiments verify the effectiveness and superiority of EHEFT-R.


2014 ◽  
Vol 538 ◽  
pp. 512-515
Author(s):  
Feng Song Li ◽  
Yuan Sheng Lou

For the issues of quality of service (QoS) in the cloud computing raised by users, this paper proposes a strategy for QoS classification and builds tasks' priority function modeling and through priority scheduling tasks, assigning tasks to the reasonable resources, and finally to complete the task efficiently, improve the utilization of resources.


Sign in / Sign up

Export Citation Format

Share Document