An evaluation of parallel job scheduling for ASCI Blue-Pacific
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
IEEE Software
A Gang-Scheduling System for ASCI Blue-Pacific
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Resource Management for High_performance PC Clusters
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
The ANL/IBM SP Scheduling System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Architecture-Independent Request-Scheduling with Tight Waiting-Time Estimations
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The EASY - LoadLeveler API Project
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Metrics and Benchmarking for Parallel Job Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Distributed Computing Center Software for the Efficient Use of Parallel Computer Systems
HPCN Europe 1994 Proceedings of the nternational Conference and Exhibition on High-Performance Computing and Networking Volume II: Networking and Tools
CCS Resource Management in Networked HPC Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
The Self-Tuning dynP Job-Scheduler
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Selective Reservation Strategies for Backfill Job Scheduling
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
A Self-Tuning Job Scheduler Family with Dynamic Policy Switching
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Performance analysis of dynamic load balancing algorithms with variable number of processors
Journal of Parallel and Distributed Computing
Selective preemption strategies for parallel job scheduling
International Journal of High Performance Computing and Networking
| Hi-index | 0.00 |
Efficient job-scheduling strategies are important to improve the performance and usability of HPC-clusters. In this paper we evaluate job-scheduling strategies (FCFS, SJF, and LJF) used in the resource management system CCS (Computing Center Software). As input for our simulations we use two job sets that are generated from trace files of CCS.Based on the evaluation we introduce the dynP scheduler which combines the three scheduling strategies and dynamically changes between them online. The average estimated runtime of jobs in the waiting queue and two bounds are used as the criterion whether or not dynP switches to a new policy. Obviously the performance of dynP depends on the setting of the two bounds. Diverse parameter pairs were evaluated, and with the proper setting dynP achieves an equal or even better (+9%) performance.