Abstract
Scheduling of a workload of parallel jobs on a large parallel computer puts specific demands on a scheduling system. Especially if the objective is to give a good service for the largest parallel jobs. In this paper we give an overview of the implementation and extensions of the Argonne EASY scheduler at PDC. We describe necessary developments of EASY to adopt to an inhomogeneous platform, improvements of the scheduling algorithm with e.g. recursive backfill, and added features such as time-lock, i.e. reservation and mixed job resources.
Preview
Unable to display preview. Download preview PDF.
References
Lifka, D.A.: The ANL/IBM SP scheduling system. Job Scheduling Strategies for Parallel Processing. IPPS’95 Workshop Proceedings. Springer-Verlag, Berlin (1995) 295–303
Skovira, J., Waiman-Chan, Honbo-Zhou, Lifka, D.: The EASY-LoadLeveler API Project. Job Scheduling Strategies for Parallel Processing. IPPS’96 Workshop Proceedings. Springer-Verlag, Berlin (1996) 41–47
Feitelson, D. G., Weil, A. M.: Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. Preprint, Institute of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel (1997)
Foster, I., Kesselman, C.: Globus: A Metacomputer Infrastructure Toolkit. Intl. J. Supercomputer Applications 11(2) (1997) 115–128
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malinowsky, L., Ă–ster, P. (1998). Scheduling of a parallel workload: Implementation and use of the argonne easy scheduler at PDC. In: KĂ¥gström, B., Dongarra, J., Elmroth, E., WaÅ›niewski, J. (eds) Applied Parallel Computing Large Scale Scientific and Industrial Problems. PARA 1998. Lecture Notes in Computer Science, vol 1541. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095351
Download citation
DOI: https://doi.org/10.1007/BFb0095351
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65414-8
Online ISBN: 978-3-540-49261-0
eBook Packages: Springer Book Archive