A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
An evaluation of parallel job scheduling for ASCI Blue-Pacific
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Trace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers
ICPP '97 Proceedings of the international Conference on Parallel Processing
Production Job Scheduling for Parallel Shared Memory Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Resource Allocation Schemes for Gang Scheduling
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
On the Development of an Efficient Coscheduling System
JSSPP '01 Revised Papers from the 7th 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
The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
Coarse-grain time slicing with resource-share control in parallel-job scheduling
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
| Hi-index | 0.00 |
This paper provides a comprehensive performance evaluation of job scheduling policies for parallel systems on which large jobs require the maximum or close to the maximum resource available on the system. A wide range of policies are evaluated, including nonpreemptive Backfill policies, time-sharing with Gang Scheduling, and dynamic Equi-spatial policies. Through detailed performance analysis, key problems of each class of policies are identified. As a simpler alternative to Gang Scheduling and Equi-spatial, we propose using a short runtime limit (e.g., one hour as opposed to 10's hours) for Backfill policies. Our simulation results show that applying a short runtime limit on jobs that request a sufficiently large number of processors has the potential to significantly improve FCFS-Backfill policies for all job classes in most workloads studied.