Robust scheduling of moldable parallel jobs

Authors:
Sudha Srinivasan;Savitha Krishnamoorthy;P. Sadayappan
Affiliations:
Department of Computer Science and Engineering, 395 Dreese Laboratories, 2015 Neil Avenue, The Ohio State University, Columbus, OH 43210, USA.;Department of Computer Science and Engineering, 395 Dreese Laboratories, 2015 Neil Avenue, The Ohio State University, Columbus, OH 43210, USA.;Department of Computer Science and Engineering, 395 Dreese Laboratories, 2015 Neil Avenue, The Ohio State University, Columbus, OH 43210, USA
Venue:
International Journal of High Performance Computing and Networking
Year:
2004

Citing 11
Cited 0

Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
Using moldability to improve the performance of supercomputer jobs

Journal of Parallel and Distributed Computing
When the Herd Is Smart: Aggregate Behavior in the Selection of Job Request

IEEE Transactions on Parallel and Distributed Systems
A Symbolic Approachto Modeling Cellular Behavior

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Using Queue Time Predictions for Processor Allocation

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler

JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Selective Reservation Strategies for Backfill Job Scheduling

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
A Model For Speedup of Parallel Programs

A Model For Speedup of Parallel Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Moldable job scheduling has been shown to be promising compared with traditional job scheduling policies. In contrast to rigid job scheduling where the number of processors for a job is fixed by the user, with moldable job scheduling the number of processors allocated to each job is chosen by the scheduler from a given range. Using simulation-based experiments, we show that previously proposed moldable scheduling strategies are not very robust overall performance improves in some circumstances, but worsens under other circumstances, and considerably degrades performance for some categories of jobs. This paper proposes a more robust strategy for scheduling moldable jobs, which outperforms the rigid scheduling scheme and previous moldable scheduling strategies. The new strategy performs well under different load conditions and for jobs of different scalabilities.