Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Multiprocessor Scheduling for High-Variability Service Time Distributions
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic vs. Static Quantum-Based Parallel Processor Allocation
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Analysis of the Early Workload on the Cornell Theory Center IBM SP2
Analysis of the Early Workload on the Cornell Theory Center IBM SP2
Improving Gang Scheduling through job performance analysis and malleability
ICS '01 Proceedings of the 15th international conference on Supercomputing
A simulation model of backfilling and I/O scheduling in a partitionable parallel system
Proceedings of the 32nd conference on Winter simulation
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
The Journal of Supercomputing
| Hi-index | 0.00 |
Gang scheduling is a job scheduling policy for parallel computers that combines elements of space-sharing and time-sharing. In this paper, we analyze the performance of gang scheduling policies that allow the remapping of an executing job to a new set of processors. Most previously proposed gang-scheduling policies do not allow such job remapping under the assumption that it is prohibitively expensive. Through a detailed trace-driven simulation, we analyze the tradeoff between the benefits and overheads of such job relocation. Our results show that gang-scheduling policies that support such job relocation offer significant performance gains over