Core Algorithms of the Maui Scheduler

  • David Jackson
  • Quinn Snell
  • Mark Clement
Conference paper

DOI: 10.1007/3-540-45540-X_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2221)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • David Jackson
    • 1
  • Quinn Snell
    • 1
  • Mark Clement
    • 1
  1. 1.Brigham Young UniversityProvo

Personalised recommendations