Abstract
This paper presents a new paradigm for parallel job scheduling called integrated scheduling or iScheduling. The iScheduler is an application-aware job scheduler as opposed to a general-purpose system scheduler. It dynamically controls resource allocation among a set of competing applications, but unlike a traditional job scheduler, it can interact directly with an application during execution to optimize resource allocation. An iScheduler may add or remove resources from a running application to improve the performance of other applications. Such fluid resource management can support both improved application and system performance. We propose a framework for building iSchedulers and evaluate the concept on several workload traces obtained both from supercomputer centers and from a set of real parallel jobs. The results indicate that iScheduling can improve both waiting time and overall turnaround time substantially for these workload classes, outperforming standard policies such as backfilling and moldable job scheduling.
Original language | English (US) |
---|---|
Pages (from-to) | 649-668 |
Number of pages | 20 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 63 |
Issue number | 6 |
DOIs | |
State | Published - Jun 1 2003 |
Bibliographical note
Funding Information:This work was sponsored in part by the Army High Performance Computing Research Center under the auspices of the Department of the Army, Army Research Laboratory cooperative Agreement Number DAAD19-01-2-0014.
Keywords
- Cluster computing
- Distributed computing
- Parallel processing
- Scheduling