Live Webcast 15th Annual Charm++ Workshop

-->

PPL/Charm++ at SC17

A Batch System with Efficient Adaptive Scheduling for Malleable and Evolving Applications
| Suraj Prabhakaran | Marcel Neumann | Sebastian Rinke | Felix Wolf | Abhishek Gupta | Laxmikant Kale
IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2015
Publication Type: Paper
Repository URL:
Abstract
The throughput of supercomputers depends not only on efficient job scheduling but also on the type of jobs that form the workload. Malleable jobs are most favorable for a cluster as they can dynamically adapt to a changing allocation of resources. The batch system can expand or shrink a running malleable job to improve system utilization, throughput, and response times. In the past, however, the rigid nature of commonly used programming models like MPI made writing malleable applications a daunting task, which is why it remained largely unrealized. This is now changing. To improve fault tolerance, load imbalance, and energy efficiency in emerging exascale systems, more adaptive programming paradigms such as Charm++ enter the scene. Although they offer better support for malleability, current batch systems still lack management facilities for malleable jobs and are therefore incapable of leveraging their potential. In this paper, we present an extension of the Torque/Maui batch system for malleability. We propose a novel malleable job scheduling strategy and show the first batch system capable of efficiently managing rigid, malleable, and evolving jobs together. We demonstrate that our strategy achieves consistently superior performance in comparison to every other state-of-the-art malleable job scheduling strategy under varying dynamics of the workload.
TextRef
People
Research Areas