Coarse-grain time slicing with resource-share control in parallel-job scheduling

Authors:
Bryan Esbaugh;Angela C. Sodan
Affiliations:
University of Windsor, Computer Science, Ontario, Canada;University of Windsor, Computer Science, Ontario, Canada
Venue:
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Year:
2007

Citing 12
Cited 1

The impact of job memory requirements on gang-scheduling performance

ACM SIGMETRICS Performance Evaluation Review
Randomization, speculation, and adaptation in batch schedulers

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
ESP: a system utilization benchmark

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
An infrastructure for efficient parallel job execution in Terascale computing environments

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Implementing Multiprocessor Scheduling Disciplines

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
Preemption Based Backfill

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

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
The workload on parallel supercomputers: modeling the characteristics of rigid jobs

Journal of Parallel and Distributed Computing
Benefit of Limited Time Sharing in the Presence of Very Large Parallel Jobs

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey: Research Articles

Concurrency and Computation: Practice & Experience
Gang Scheduling and Adaptive Resource Allocation to Mitigate Advance Reservation Impact

CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid

Service control with the preemptive parallel job scheduler Scojo-PECT

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides control regarding the resource shares allocated to different job classes. We demonstrate that this approach significantly improves response times for short and medium jobs and that it permits controlling different desirable resource-shares for different job classes at different times of the day according to site policies.