Research on cloud task scheduling algorithm of Particle Swarm Optimization algorithm based on fission mechanism

Author(s):  
Youwei Shao
2010 ◽  
Vol 439-440 ◽  
pp. 1487-1492 ◽  
Author(s):  
Shao Bo Zhong ◽  
Zhong Shi He

Grid task scheduling (GTS) is a NP-hard problem. This paper proposes an optimized GTS algorithm which combines with the advantages of cloud model based on the particle swarm optimization algorithm. This algorithm iterates tasks utilizing the advantages of particle swarm optimization algorithm and then gets a set of candidate solutions quickly. In addition, this algorithm modifies the value of entropy and excess entropy using the characteristics of cloud model and implements the transformation between qualitative variables and quantity of uncertain events. And this algorithm makes particles fly to the global optimal solutions by exact searching in local areas. Theoretical analysis and simulation results show that this algorithm makes load balance of resource efficiently. It also avoids the problems of genetic algorithm and basic particle swarm optimization algorithm, which would easily fall into local optimal solutions and premature convergence caused by too much selected pressure. This algorithm has the advantages of high precision and faster convergence and can be applied in task scheduling on computing grid.


2013 ◽  
Vol 380-384 ◽  
pp. 2841-2844
Author(s):  
Yan Xu

This paper studies effective task scheduling problem in the process of grid computing. Generally, task scheduling in the process of grid computing can be realized in shorter time, which guarantees the efficiency of task scheduling in grid computing. Traditional algorithm can not fully consider the resources load balance in calculating task scheduling in grid computing, resulting in network resources idleness. Finally, it can't reasonably use network resources. In order to avoid the above defects, this paper proposes a task scheduling method in grid computing based on double fitness particle swarm optimization algorithm. In the process of grid computing, channel perception method is applied to forecast the amount of grid computing tasks in the channel so as to provide the basis for task scheduling in grid computing. Realize task scheduling in grid computing by the use of double fitness particle swarm optimization algorithm. Experimental results show that under the condition of larger tasks of grid computing, the performance of task scheduling in grid computing by using the algorithm presented in this paper is superior to the traditional particle swarm optimization algorithm and can get ideal task scheduling result.


2010 ◽  
Vol 108-111 ◽  
pp. 392-397
Author(s):  
Peng Cheng Wei ◽  
Xi Shi

Based on particle swarm optimization algorithm, this paper presents a grid scheduling optimization algorithm combing the advantages of Ant Colony optimization algorithm. The algorithm processes task scheduling through particle swarm optimization algorithm to get a group of relatively optimal solutions, and then conducts small-area local search with Ant Colony optimization algorithm. Theoretical analysis and results of the simulation experiments show that this scheduling algorithm effectively achieves load balancing of resources with comprehensive advantages in time efficiency and solution accuracy compared to the traditional Ant Colony optimization algorithm and particle swarm optimizationalgorithm, and can be applied to task scheduling in grid computing.


Sign in / Sign up

Export Citation Format

Share Document