Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/646382.689682guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Core Algorithms of the Maui Scheduler

Published: 16 June 2001 Publication History

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.

References

[1]
D. Jackson. The Maui Scheduler. Technical report. http://supercluster.org/projects/maui.
[2]
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.
[3]
R.L. Henderson. Job scheduling under the Portable Batch System. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949, 1995.
[4]
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.
[5]
D. Jackson. HPC workload repository. Technical report. http://www.supercluster.org/research/traces.
[6]
D. Feitelson and A. Mu'alem Weil. Utilization and predicability in scheduling the IBM SP2 with backfilling. In Proceedings of IPPS/SPDP, April 1998.
[7]
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.
[8]
John Jardine. Avoiding livelock using the Y Metascheduler and exponential backoff. Master's thesis, Brigham Young University, 2000.
[9]
D. Jackson, Q. Snell, and M. Clement. Simulation based HPC workload analysis. In International Parallel and Distributed Processing Symposium, 2001.

Cited By

View all
  • (2018)GPU age-aware scheduling to improve the reliability of leadership jobs on TitanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.5555/3291656.3291666(1-11)Online publication date: 11-Nov-2018
  • (2018)SSMProceedings of the 2018 2nd International Conference on Cloud and Big Data Computing10.1145/3264560.3264568(11-15)Online publication date: 3-Aug-2018
  • (2018)GPU age-aware scheduling to improve the reliability of leadership jobs on TitanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC.2018.00010(1-11)Online publication date: 11-Nov-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
JSSPP '01: Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
June 2001
205 pages
ISBN:3540428178

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 16 June 2001

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2018)GPU age-aware scheduling to improve the reliability of leadership jobs on TitanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.5555/3291656.3291666(1-11)Online publication date: 11-Nov-2018
  • (2018)SSMProceedings of the 2018 2nd International Conference on Cloud and Big Data Computing10.1145/3264560.3264568(11-15)Online publication date: 3-Aug-2018
  • (2018)GPU age-aware scheduling to improve the reliability of leadership jobs on TitanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC.2018.00010(1-11)Online publication date: 11-Nov-2018
  • (2018)A new rule-based power-aware job scheduler for supercomputersThe Journal of Supercomputing10.1007/s11227-018-2281-174:6(2508-2527)Online publication date: 1-Jun-2018
  • (2017)A survey of high-performance computing scaling challengesInternational Journal of High Performance Computing Applications10.1177/109434201559708331:1(104-113)Online publication date: 1-Jan-2017
  • (2017)Scheduling Scientific Workloads in Private CloudProceedings of the10th International Conference on Utility and Cloud Computing10.1145/3147213.3147223(9-18)Online publication date: 5-Dec-2017
  • (2017)K-Level with Buddy Memory Allocation (BMA) Approach for Parallel Workload SchedulingWireless Personal Communications: An International Journal10.1007/s11277-016-3563-794:4(2473-2486)Online publication date: 1-Jun-2017
  • (2016)Complex Job Scheduling Simulations with Alea 4Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques10.5555/3021426.3021446(124-129)Online publication date: 22-Aug-2016
  • (2016)BaymaxACM SIGARCH Computer Architecture News10.1145/2980024.287236844:2(681-696)Online publication date: 25-Mar-2016
  • (2016)BaymaxACM SIGPLAN Notices10.1145/2954679.287236851:4(681-696)Online publication date: 25-Mar-2016
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media