Evaluation of Job-Scheduling Strategies for Grid Computing
In this paper, we discuss typical scheduling structures that occur in computational grids. Scheduling algorithms and selection strategies applicable to these structures are introduced and classified. Simulations were used to evaluate these aspects considering combinations of different Job and Machine Models. Some of the results are presented in this paper and are discussed in qualitative and quantitative way. For hierarchical scheduling, a common scheduling structure, the simulation results confirmed the benefit of Backfill. Unexpected results were achieved as FCFS proves to perform better than Backfill when using a central job-pool.
KeywordsSchedule Algorithm Computational Grid Machine Model Trace Data Local Schedule
Unable to display preview. Download preview PDF.
- 3.C. Bitten, J. Gehring, R. Yahyapour, and U. Schwiegelshohn. The NRW-Metacomputer: Building blocks for a worldwide computational grid. In Heterogeneous Computing Workshop 2000 at IPDPS 2000, Cancun, Mexico, May 2000.Google Scholar
- 4.D.G. Feitelson and A.M. Weil. Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In Procedings of IPPS/SPDP 1998, pages 542–546. IEEE Computer Society, 1998.Google Scholar
- 5.I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. 11(2):115–128, 1997.Google Scholar
- 6.A. Grimshaw, A. Wulf, J. French, A Weaver, and P. Reynolds. Legion: The next logical step toward a nationwide virtual supercomputer. Technical Report CS-94-21, University of Virginia, Computer Sciences Department, 1994.Google Scholar
- 8.J. Krallmann, U. Schwiegelshohn, and R. Yahyapour. On the design and evaluation of job scheduling algorithms. In Fifth Annual Workshop on Job Scheduling Strategies for Parallel Processing, IPPS’99; San Juan, Puerto Rico; April 1999, Lectures Notes in Computer Science, pages 17–42, 1999.Google Scholar
- 9.D.A. Lifka. The ANL/IBM SP scheduling system. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295–303. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.Google Scholar
- 10.M. Litzkow, M. Livny, and M. Mutka. Condor-a hunter of idle workstations. In Proceedings of the 8th Intl Conf. on Distributed Computing Systems, pages 104–111, 1988.Google Scholar
- 12.A. Streit. Evaluation of Scheduling-Algorithms for Metacomputing (in German). In Diploma Thesis at CEI. University of Dortmund, Germany, 1999.Google Scholar
- 13.G. D. van Albada, J. Clinckemaillie, A. H. L. Emmen, J. Gehring, O. Heinz, F. van der Linden, B. J. Overeinder, A. Reinefeld, and P. M. A. Sloot. Dynamite-blasting obstacles to parallel cluster computing. In P. M. A. Sloot, M. Bubak, A. G. Hoekstra, and L. O. Hertzberger, editors, High-Performance Computing and Networking (HPCN Europe’ 99), Amsterdam, The Netherlands, number1593 in Lecture Notes in Computer Science, pages 300–310, Berlin, April 1999. Springer-Verlag.Google Scholar