Extending goal-oriented parallel computer job scheduling policies to heterogeneous systems

Authors:
S. Vasupongayya;A. Prasitsupparote
Affiliations:
Department of Computer Engineering, Prince of Songkla University, Hat Yai, Thailand 90110;Faculty of Technology and Environment, Prince of Songkla University, Kathu, Thailand 83120
Venue:
The Journal of Supercomputing
Year:
2013

Citing 13
Cited 0

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

IEEE Transactions on Parallel and Distributed Systems
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on 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
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 and Stabilizing Parallel Computer Performance Using Adaptive Backfilling

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Backfilling with lookahead to optimize the packing of parallel jobs

Journal of Parallel and Distributed Computing
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates

IEEE Transactions on Parallel and Distributed Systems
Design and Potential Performance of Goal-Oriented Job Scheduling Policies for Parallel Computer Workloads

IEEE Transactions on Parallel and Distributed Systems
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A job self-scheduling policy for HPC infrastructures

JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
A novel multi-agent reinforcement learning approach for job scheduling in Grid computing

Future Generation Computer Systems
Towards automated HPC scheduler configuration tuning

Concurrency and Computation: Practice & Experience
Scheduling Batch and Heterogeneous Jobs with Runtime Elasticity in a Parallel Processing Environment

IPDPSW '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several existing parallel computer systems partition their system resources or consist of systems from different geographical locations. This work is focusing on extending the original goal-oriented parallel computer job scheduling policies to cover such systems. The goal-oriented parallel computer job scheduling policies are proposed recently to handle conflicting objectives by utilizing a combinatorial search technique to find the most compromise schedule within a time limit. In this paper, some modifications to the original goal-oriented parallel computer job scheduling policy design are proposed and evaluated. The proposed policy is evaluated against basic priority backfilling techniques widely used in the field. Both homogeneous and heterogeneous parallel computer systems in terms of the computing power are evaluated. And, the design decision on the partition selection heuristic is also evaluated in this study. The experimental results show that the proposed policy produces good scheduling performances even when inaccurate runtime information is used.