Node-Based Job Scheduling for Large Scale Simulations of Short Running Jobs

Chansup Byun, William Arcand, David Bestor, Bill Bergeron, Vijay N. Gadepally, Michael E. Houle, Matthew Hubbell, Michael Jones, Anna Klein, Peter W. Michaleas, Lauren Milechin, Julie Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Charles Yee, Jeremy Kepner · 2021

Diverse workloads such as interactive supercomputing, big data analysis, and large-scale AI algorithm development, requires a high-performance scheduler. This paper presents a novel node-based scheduling approach for large scale simulations of short running jobs on MIT SuperCloud systems, that allows the resources to be fully utilized for both long running batch jobs while simultaneously providing fast launch and release of large-scale short running jobs. The node-based scheduling approach has demonstrated up to 100 times faster scheduler performance that other state-of-the-art systems.

Read the paper · More papers on PaperTik