TABU SEARCH ALGORITHM FOR SCHEDULING INDEPENDENT JOBS IN COMPUTATIONAL GRIDS

被引：0

作者：

Xhafa, Fatos ^{[1
]}

Carretero, Javier ^{[1
]}

Dorronsoro, Bernabe ^{[2
]}

Alba, Enrique ^{[3
]}

机构：

[1] Univ Politecn Cataluna, Dept Languages & Informat Syst, Catalonia, Spain

[2] Univ Luxembourg, Fac Sci Technol & Commun, Luxembourg, Luxembourg

[3] Univ Malaga, Dept Languages & Comp Sci, E-29071 Malaga, Spain

来源：

COMPUTING AND INFORMATICS | 2009年 / 28卷 / 02期

关键词：

Job scheduling; computational grid; tabu search;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications, and it is a computationally hard problem even when there are no dependencies among jobs. We present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We define it as a bi-objective optimization problem, consisting of the minimization of the makespan and flowtime. Our TS is validated versus three other algorithims in the literature for a classical benchmark. We additionally consider some more realistic benchmarks with larger size instances in static and dynamic environments. We show that our TS clearly outperforms the compared algorithms.

引用

页码：237 / 250

页数：14