Scheduling in a grid computing environment using genetic algorithms

1 January 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 5 pp-297
https://doi.org/10.1109/ipdps.2002.1016654

Abstract

We investigate the possibility to use the computing GRID in a flexible way to permit the maximum usage of resources. In our simulation the jobs submitted by the users provide a characterization of themself to help the system scheduler to do an optimal scheduling in case of resources contention. We use a genetic algorithms to select an optimal or suboptimal scheduling of the jobs. In this preliminary tests we show how the solution founded may maximize the total machine throughput considering not only the single job request but all the job requests during the scheduling process. In this work we show that it is possible to resolve conflicts in the usage of the total computing power and in the data locality for a reasonable number of jobs.

Keywords

This publication has 1 reference indexed in Scilit:

Distributed genetic algorithms for the floorplan design problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991