Journal of Grid Computing

, Volume 4, Issue 1, pp 1–17

An Adaptive Scheduler for Grids

  • Fabiano de O. Lucchese
  • Eduardo J. Huerta Yero
  • Francisco S. Sambatti
  • Marco A. A. Henriques

DOI: 10.1007/s10723-005-9006-4

Cite this article as:
de O. Lucchese, F., Huerta Yero, E.J., Sambatti, F.S. et al. J Grid Computing (2006) 4: 1. doi:10.1007/s10723-005-9006-4


The recent development of telecommunication infra-structures such as the world-wide networks, interconnecting millions of computers spread all over the world, has made possible the coordinated use of a large amount of heterogeneous, weakly connected computational resources. This new area, known as Grid computing, is currently the focus of several research activities and projects. However, as in every new domain of research, in this one there are many unsolved questions, in particular those related to the management of the processing load inside the system. In this work, the problem of balancing processing loads on a Grid is approached by the introduction of the Generational Scheduling with Task Replication (GSTR) algorithm. A comprehensive set of simulations and tests is carried out in order to validate the proposed solution. A methodology for calculating and analyzing speed-up and efficiency ratios on heterogeneous groups of computers is also shown.

Key words

fault tolerant schedulersGridssemi-static scheduling



Generational scheduling


Generational scheduling with task replication


Processing unit


Relative estimated performance


Relative real performance

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Fabiano de O. Lucchese
    • 1
  • Eduardo J. Huerta Yero
    • 1
  • Francisco S. Sambatti
    • 2
  • Marco A. A. Henriques
    • 3
  1. 1.Sparsi Grid ComputingTaquaral Campinas, SPBrazil
  2. 2.Western Paraná State UniversityCascavel, PRBrazil
  3. 3.Faculty of Electrical and Computer EngineeringUniversity of CampinasSão PauloBrazil