Hybrid PSO for Independent Task scheduling in Grid Computing to Decrease Makespan

Abs tract. Task assignment Problem in Grid Computing is a NP-Complete Problem that has been studied by several researchers. The broker undertake scheduling applications belonged to user should have an efficient scheduling algorithm. In this paper, a new optimized scheduling hybrid algorithm was presented named GPSO. GPSO is composed of both Particle Swarm Optimization and GELS algorithms. Since PSO is weak on local search, GELS was used for improve it and avoid becoming trapped in a local optimum. GPSO is done independent Task scheduling to decrease Makespan and minimize the missed tasks. The experimental results showed Effectiveness of the proposed combined approach in finding optimal solutions. Keyw ords: Grid Computing, Particle Swarm Optimization (PSO), Scheduling, Independent Task.

[1]  Siamak Barzegar,et al.  A new Method on Resource Scheduling in grid systems based on Hierarchical Stochastic Petri net , 2010 .

[2]  P. J. Bernhard,et al.  Solving combinatorial optimization problems using a new algorithm based on gravitational attraction , 2004 .

[3]  Yang Gao,et al.  Adaptive grid job scheduling with genetic algorithms , 2005, Future Gener. Comput. Syst..

[4]  E. Tsang,et al.  Guided Local Search , 2010 .

[5]  Kamran Zamanifar,et al.  A Novel Particle Swarm Optimization Approach for Grid Job Scheduling , 2009, ICISTM.

[6]  S. N. Sivanandam,et al.  Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia , 2007, Int. J. Comput. Sci. Appl..

[7]  Zhang Wei,et al.  A new hybrid optimization algorithm for the job-shop scheduling problem , 2004, Proceedings of the 2004 American Control Conference.

[8]  Graham Ritchie,et al.  Static Multi-processor Scheduling with Ant Colony Optimisation & Local Search , 2003 .

[9]  Sheldon Howard Jacobson,et al.  Analysis of Static Simulated Annealing Algorithms , 2002 .

[10]  Yu Jinshou,et al.  An Improved PSO Algorithm and its Application to Grid Scheduling Problem , 2008, 2008 International Symposium on Computer Science and Computational Technology.

[11]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[12]  Rajkumar Buyya,et al.  Nature's heuristics for scheduling jobs on Computational Grids , 2000 .