Dynamic grid scheduling algorithm based on self-adaptive Tabu Search
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2010 International Conference On Computer Design and Applications
- Vol. 2, V2-271-V2-274
- https://doi.org/10.1109/iccda.2010.5541410
Abstract
In this paper, a self-adaptive algorithm based on Tabu Search (TS) is proposed to minimize the makespan, which is suitable to the grid dynamic characteristic. The process of scheduling is divided into partial scheduling, and last partial information is exploited to decide the next partial scheduling parameters set, which is self-adaptive to the stochastic environment. The algorithm was simulated in GridSim toolkit and the results demonstrated that the proposed algorithm improved performance compared to existing scheduling techniques.Keywords
This publication has 8 references indexed in Scilit:
- Grid Clustering With Genetic Algorithm and Tabu Search ProcessJournal of Pattern Recognition Research, 2009
- A Task Scheduling Algorithm Based on PSO for Grid ComputingInternational Journal of Computational Intelligence Research, 2008
- Improving Scheduling of Scientific Workflows Using Tabu Search for Computational GridsInformation Technology Journal, 2007
- A comparison among grid scheduling algorithms for independent coarse-grained tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- QoS guided Min-Min heuristic for grid task schedulingJournal of Computer Science and Technology, 2003
- Grids and Grid technologies for wide‐area distributed computingSoftware: Practice and Experience, 2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- New approaches for heuristic search: A bilateral linkage with artificial intelligenceEuropean Journal of Operational Research, 1989