Dynamic grid scheduling algorithm based on self-adaptive Tabu Search

Author

Kong, Xiaohong ; Shen, Hong ; Chen, Xiqu ; Wang, Chao ; Song, Changyuan

Author_Institution

Sch. of Mech. & Electr. Eng., Henan Inst. of Sci. & Technol., Xinxiang, China

Volume

2

fYear

2010

fDate

25-27 June 2010

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

grid computing; scheduling; search problems; GridSim toolkit; dynamic grid scheduling; partial scheduling; self-adaptive algorithm; self-adaptive tabu search; stochastic environment; Algorithm design and analysis; Chaos; Distributed computing; Dynamic scheduling; Grid computing; Heuristic algorithms; Processor scheduling; Resource management; Scheduling algorithm; Stochastic processes; dynamic; grid scheduling; self-adaptive; tabu search;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design and Applications (ICCDA), 2010 International Conference on

Conference_Location

Qinhuangdao

Print_ISBN

978-1-4244-7164-5

Electronic_ISBN

978-1-4244-7164-5

Type

conf

DOI

10.1109/ICCDA.2010.5541410

Filename

5541410