Gang scheduling is a job scheduling policy for parallel computers that combines elements of spacesharing 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 policies that do not use remapping.
|
245
|
A case for NOW (Networks of Workstations
– Anderson, Culler, et al.
- 1995
|
|
240
|
Scheduling Techniques for Concurrent Systems
– Ousterhout
- 1982
|
|
205
|
Process Control and Scheduling Issues for Multiprogrammed SharedMemory Multiprocessors
– Tucker, Gupta
- 1989
|
|
153
|
The performance of multiprogrammed multiprocessor scheduling policies
– Leutenegger, Vernon
- 1990
|
|
136
|
A Survey of Scheduling in Multiprogrammed Parallel Systems
– Feitelson
- 1994
|
|
113
|
Characterizations of parallelism in applications and their use in scheduling
– Sevcik
- 1989
|
|
106
|
Gang Scheduling Performance Benefits for Fine-Grained Synchronization
– Feitelson, Rudolph
- 1992
|
|
97
|
Processor Scheduling in Shared Memory Multiprocessors
– Zahorjan, McCann
- 1990
|
|
87
|
Use of application characteristics and limited preemption for run to completion parallel processor scheduling policies
– Chiang, Mansharamani, et al.
- 1994
|
|
81
|
Packing schemes for gang scheduling
– Feitelson
- 1996
|
|
78
|
Distributed hierarchical control for parallel processing
– Feitelson, Rudolph
- 1990
|
|
76
|
Scheduling and page migration for multiprocessor compute servers
– Chandra, Devine, et al.
- 1994
|
|
62
|
An Introduction to Operating Systems
– Deitel
- 1990
|
|
51
|
Workload evolution on the cornell theory center ibm sp2
– Hotovy
- 1996
|
|
50
|
Performance analysis of job scheduling policies in parallel supercomputing environments
– Naik, Squillante, et al.
- 1993
|
|
44
|
Multiprogramming on Multiprocessors
– Crovella, Das, et al.
- 1991
|
|
41
|
Robust partitioning policies of multiprocessor systems. Performance Evaluation
– Rosti, Smirni, et al.
- 1994
|
|
40
|
Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers
– McCann, Zahorjan
- 1995
|
|
33
|
Processor Pool-Based Scheduling for Large-Scale NUMA Multiprocessors
– Zhou, Brecht
- 1991
|
|
30
|
Analysis of the impact of memory in distributed parallel processing systems
– Peris, Squillante, et al.
- 1994
|
|
25
|
Gang Scheduling for Highly Efficient Distributed Multiprocessor Systems
– Franke, Pattnaik, et al.
- 1996
|
|
21
|
Analysis of the early workload on the cornell theory center ibm sp2
– Hotovy, Schneider, et al.
- 1996
|
|
19
|
Dynamic vs. static quantum-based parallel processor allocation
– Chiang, Vernon
- 1996
|
|
19
|
Multiprocessor scheduling for high-variability service time distributions
– Parsons, Sevcik
- 1995
|
|
10
|
A system for dynamic resource allocation and data distribution
– Moreira, Naik, et al.
- 1995
|
|
9
|
An analysis of gang scheduling for multiprogrammed parallel computing environments
– Squillante, Wang, et al.
- 1996
|
|
7
|
editors. Job Scheduling Strategies for Parallel
– Feitelson, Rudolph
- 1995
|
|
5
|
Paging tradeoffs in distributed shared-memory multiprocessors
– Burger, Hyder, et al.
- 1996
|
|
3
|
et al. A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments
– Wang
- 1996
|
|
2
|
Satish Tripathi. Processor Scheduling on Multiprogrammed, Distributed Memory Parallel Computers
– Setia, Squillante
- 1993
|
|
1
|
The Gang Scheduler -- Timesharing on a Cray T3D
– Jette, Storch, et al.
|
|
1
|
Queueing Systems Volume II: Applications
– Kleinrock
- 1976
|
