Local Search for Grid Scheduling

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Title in English Lokální prohledávání pro rozvrhování na Gridech
Authors

KLUSÁČEK Dalibor MATYSKA Luděk RUDOVÁ Hana BARAGLIA Ranieri CAPANNINI Gabriele

Year of publication 2007
Type Conference abstract
MU Faculty or unit

Faculty of Informatics

Citation
Description This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs. Algorithm performance was compared with typical queue-based algorithms on the basis of objective function optimisation and time required to generate scheduling solutions. Grid environment was simulated by Alea Simulator which is based on modified and extended GridSim toolkit. The results showed that local search based algorithms may be promising technique with good overall performance, providing better results than queue-based approaches while still fast enough to provide solution in a reasonable time.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info