Selective preemption strategies for parallel job scheduling

Authors:
Rajkumar Kettimuthu;Vijay Subramani;Srividya Srinivasan;Thiagaraja Gopalsamy;D. K. Panda;P. Sadayappan
Affiliations:
Argonne National Laboratory, Argonne, IL 60439, USA/ The University of Chicago, Chicago, IL 60615, USA.;Microsoft Corporation, Redmond, WA 98052, USA.;Microsoft Corporation, Redmond, WA 98052, USA.;Altera Corporation, San Jose, CA 95134, USA.;The Ohio State University, Columbus, OH 43210, USA.;The Ohio State University, Columbus, OH 43210, USA
Venue:
International Journal of High Performance Computing and Networking
Year:
2005

Citing 31
Cited 4

Processor scheduling in shared memory multiprocessors

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of multiprogrammed multiprocessor scheduling algorithms

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors

ACM Transactions on Computer Systems (TOCS)
Application scheduling and processor allocation in multiprogrammed parallel processing systems

Performance Evaluation - Special issue: performance modeling of parallel processing systems
Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies

SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On multiprocessor system scheduling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Parallel application scheduling on networks of workstations

Journal of Parallel and Distributed Computing
Preemptive scheduling of parallel jobs on multiprocessors

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Randomization, speculation, and adaptation in batch schedulers

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
A comparative study of online scheduling algorithms for networks of workstations

Cluster Computing
Attacking the bottlenecks of backfilling schedulers

Cluster Computing
When the Herd Is Smart: Aggregate Behavior in the Selection of Job Request

IEEE Transactions on Parallel and Distributed Systems
On Job Scheduling for HPC-Clusters and the dynP Scheduler

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
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
Production Job Scheduling for Parallel Shared Memory Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The ANL/IBM SP Scheduling System

IPPS '95 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
Implementing Multiprocessor Scheduling Disciplines

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling

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
Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Selective Buddy Allocation for Scheduling Parallel Jobs on Clusters

CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Job-Length Estimation and Performance in Backfilling Schedulers

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Characterization of Backfilling Strategies for Parallel Job Scheduling

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Self-Adapting Backfilling Scheduling for Parallel Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing

Performance analysis of preemption-aware scheduling in multi-cluster grid environments

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
QoS and preemption aware scheduling in federated and virtualized Grid computing environments

Journal of Parallel and Distributed Computing
Parallel job scheduling for power constrained HPC systems

Parallel Computing
Resource provisioning based on lease preemption in InterGrid

ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113

Quantified Score

Hi-index	0.04

Visualization

Abstract

Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation based study, using real job logs from supercomputer centres. We develop a tuneable selective suspension strategy and demonstrate its effectiveness. We also present new insights into the effect of preemptive scheduling on different job classes and deal with the impact of suspensions on worst case response time. Further, we analyse the performance of the proposed schemes under different load conditions.