An Adaptive Scheduler for Grids
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 wordsfault tolerant schedulers Grids semi-static scheduling
Generational scheduling with task replication
Relative estimated performance
Relative real performance
Unable to display preview. Download preview PDF.
- 5.I. Foster, C. Kesselman, J. Nick and S. Tuecke, “Grid services for distributed system integration,” Computer, Vol. 35, No. 6, 2002.Google Scholar
- 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.Google Scholar
- 8.J.H. Conway and R.K. Guy, The Book of Numbers, Springer, 1996.Google Scholar