In: Computing and Informatics, vol. 28, no. 2
F. Xhafa - J. Carretero - B. Dorronsoro - E. Alba
Detaily:
Rok, strany: 2009, 237 - 250
Kľúčové slová:
Job scheduling, computational grid, tabu search
O článku:
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 algorithms 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.
Ako citovať:
ISO 690:
Xhafa, F., Carretero, J., Dorronsoro, B., Alba, E. 2009. A Tabu Search Algorithm for Scheduling Independent Jobs in Computational Grids. In Computing and Informatics, vol. 28, no.2, pp. 237-250. 1335-9150.
APA:
Xhafa, F., Carretero, J., Dorronsoro, B., Alba, E. (2009). A Tabu Search Algorithm for Scheduling Independent Jobs in Computational Grids. Computing and Informatics, 28(2), 237-250. 1335-9150.