scholarly journals Cloud Task Scheduling Algorithm based on Improved Genetic Algorithm

Author(s):  
Hu Yao
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.


2014 ◽  
Vol 1030-1032 ◽  
pp. 1671-1675
Author(s):  
Yue Qiu ◽  
Jing Feng Zang

This paper puts forward an improved genetic scheduling algorithm in order to improve the execution efficiency of task scheduling of the heterogeneous multi-core processor system and give full play to its performance. The attribute values and the high value of tasks were introduced to structure the initial population, randomly selected a method with the 50% probability to sort for task of individuals of the population, thus to get high quality initial population and ensured the diversity of the population. The experimental results have shown that the performance of the improved algorithm was better than that of the traditional genetic algorithm and the HEFT algorithm. The execution time of tasks was reduced.


Sign in / Sign up

Export Citation Format

Share Document