scholarly journals Research for the Task Scheduling Algorithm Optimization based on Hybrid PSO and ACO for Cloud Computing

2014 ◽  
Vol 7 (5) ◽  
pp. 87-96 ◽  
Author(s):  
JieHui JU ◽  
WeiZheng BAO ◽  
ZhongYou WANG ◽  
Ya WANG ◽  
WenJuan LI

Cloud computing brings computing resources such as software and hardware, it serve service to the users through a network. Major concept of cloud computing is to share the marvellous storage section. In cloud computing, the user jobs are prepared and executed with appropriate resources to successfully deliver the services. There are large amount of task allocation techniques that are used to accomplish task planning. In order to improve the task scheduling technique, so we proposed method of efficient task scheduling algorithm. Optimization techniques are solving NP-hard problems is very famous. In this proposed technique, user tasks are stored in the order of queue methods. The priority is designed and allocated suitable resources for the task. New tasks are investigated and kept in the on-demand priority of queue. The output of the on-demand queue is given to the MWOA. It has been proved that this algorithm is capable to eliminate optimization problems and outperform the current algorithms. The method is proposed to the required more number of iterations is reduced. The proposed algorithm is compared with various scheduling algorithms such as, genetic algorithm, ant colony, standard grey wolf optimization and particle swarm optimization. The outcomes of tests indicate the better efficiency of the MWOA in expressions of makespan and energy consumption.


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.


Author(s):  
S. Magesh Kumar ◽  
V. Auxilia Osvin Nancy ◽  
A Balasundaram ◽  
Seena Naik korra ◽  
D Kothandaraman ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document