Skip to main content
Log in

An Adaptive Scheduler for Grids

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Abbreviations

GS:

Generational scheduling

GSTR:

Generational scheduling with task replication

PU:

Processing unit

REP:

Relative estimated performance

RRP:

Relative real performance

References

  1. D.F. Baca, “Allocation modules to processors in a distributed system” IEEE Transactions on Software Engineering, SE–Vol. 15, No. 11, pp. 1427–1436, 1989.

    Article  Google Scholar 

  2. C.A. Bohn and G.B. Lamont, “Load balancing for heterogeneous clusters of PCs,” Future Generation Computer Systems, Vol. 18, pp. 389–400, 2002.

    Article  Google Scholar 

  3. B.R. Carter, D.W. Watson, F.R.F. Freund, K. Elaine, M. Francesca and H.J. Siegel, “Generational scheduling for dynamic task management in heterogeneous computing systems,” Journal of Information Sciences, Vol. 106, pp. 219–236, 1998.

    Article  Google Scholar 

  4. J. H. Epenema, M. Livny, R. Van Dantzig, X. Evers and J. Pruyne, “A worldwide flock of condors: Load sharing among workstations clusters,” Future Generation Computer Systems, Vol. 12, pp. 53–65, 1996.

    Article  Google Scholar 

  5. I. Foster, C. Kesselman, J. Nick and S. Tuecke, “Grid services for distributed system integration,” Computer, Vol. 35, No. 6, 2002.

  6. A.S. Grimshaw and W. A. Wulf, “Legion—A view from 50,000 feet Los Alamitos, California,” in Proceedings of the Fifth IEEE International Symposium on High Performance Distributed Computing, Agosto, IEEE Computer Society Press, 1996.

  7. E.J.H. Yero, F. de Oliveira Lucchese, F.S. Sambatti, M.V. Zuben and M.A.A. Henriques, “JoiN: The implementation of a Java-based massively parallel,” Grid Future Generation Computer Systems, Vol. 21, pp. 791–810, 2005.

    Article  Google Scholar 

  8. J.H. Conway and R.K. Guy, The Book of Numbers, Springer, 1996.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabiano de O. Lucchese.

Rights and permissions

Reprints and permissions

About this article

Cite this article

de O. Lucchese, F., Huerta Yero, E.J., Sambatti, F.S. et al. An Adaptive Scheduler for Grids. J Grid Computing 4, 1–17 (2006). https://doi.org/10.1007/s10723-005-9006-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-005-9006-4

Key words

Navigation