Parallel Job Scheduling: Issues and Approaches
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
The Performance Impact of Advance Reservation Meta-scheduling
IPDPS '00/JSSPP '00 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
Preemption in Concurrent Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Gang Scheduling with Memory Considerations
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Another approach to backfilled jobs: applying virtual malleability to expired windows
Proceedings of the 19th annual international conference on Supercomputing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
Journal of Parallel and Distributed Computing
An enhanced grid scheduling with job priority and equitable interval job distribution
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive 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
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
Scheduling with preemption for incident management: when interrupting tasks is not such a bad idea
Proceedings of the Winter Simulation Conference
Resource provisioning based on lease preemption in InterGrid
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
| Hi-index | 0.00 |
Recent advances in DNA analysis, global climate modeling and computational fluid dynamics have increased the demand for supercomputing resources. Through increasing the efficiency and throughput of existing supercomputing centers, additional computational power can be provided for these applications. Backfill has been shown to increase the efficiency of supercomputer schedulers for large, homogenous machines[1]. Utilizations can still be as low as 60% for machines with heterogeneous resources and strict administrative requirements. Preemption based backfill allows the scheduler to be more aggressive in filling up the schedule for a supercomputer[2]. Utilization can be increased and administrative requirements relaxed if it is possible to preempt a running job to allow a higher priority task to run.