Abstract
The Maui scheduler has received wide acceptance in the HPC community as a highly configurable and effective batch scheduler. It is currently in use on hundreds of SP, O2K, and Linux cluster systems throughout the world including a high percentage of the largest and most cutting edge research sites. While the algorithms used within Maui have proven themselves effective, nothing has been published to date documenting these algorithms nor the configurable aspects they support. This paper focuses on three areas of Maui scheduling, specifically, backfill, job prioritization, and fairshare. It briefly discusses the goals of each component, the issues and corresponding design decisions, and the algorithms enabling the Maui policies. It also covers the configurable aspects of each algorithm and the impact of various parameter selections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Jackson. The Maui Scheduler. Technical report. http://supercluster.org/projects/maui.
J.S. Skovira, W. Chen, and H. Zhou. The EASY-LoadLeveler API Project. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 41–47, 1996.
R.L. Henderson. Job scheduling under the Portable Batch System. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949, 1995.
J.M. Barton and N. Bitar. A scalable multi-discipline multiple processor scheduling framework for IRIX. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949, 1995.
D. Jackson. HPC workload repository. Technical report. http://www.supercluster.org/research/traces.
D. Feitelson and A. Mu’alem Weil. Utilization and predicability in scheduling the IBM SP2 with backfilling. In Proceedings of IPPS/SPDP, April 1998.
Q. Snell, M. Clement, D. Jackson, and C. Gregory. The performance impact of advance reservation metascheduling. Lecture Notes in Computer Science:Job Scheduling Strategiew for Parallel Processing, 1911, 2000.
John Jardine. Avoiding livelock using the Y Metascheduler and exponential backo off Master’s thesis, Brigham Young University, 2000.
D. Jackson, Q. Snell, and M. Clement. Simulation based HPC workload analysis. In International Parallel and Distributed Processing Symposium, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jackson, D., Snell, Q., Clement, M. (2001). Core Algorithms of the Maui Scheduler. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2001. Lecture Notes in Computer Science, vol 2221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45540-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-45540-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42817-6
Online ISBN: 978-3-540-45540-0
eBook Packages: Springer Book Archive