TY - GEN
T1 - An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration
AU - Zhang, Y.
AU - Franke, H.
AU - Moreira, J. E.
AU - Sivasubramaniam, A.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - Effective scheduling strategies to improve response times, throughput, and utilization are an important consideration in large supercomputing environments. Such machines have traditionally used space-sharing strategies to accommodate multiple jobs at the same time. This approach, however, can result in low system utilization and large job wait times. This paper discusses three techniques that can be used beyond simple space-sharing to greatly improve the performance figures of large parallel systems. The first technique we analyze is backfilling, the second is gang-scheduling, and the third is migration. The main contribution of this paper is an evaluation of the benefits from combining the above techniques. We demonstrate that, under certain conditions, a strategy that combines backfilling, gang-scheduling, and migration is always better than the individual strategies for all quality of service parameters that we consider.
AB - Effective scheduling strategies to improve response times, throughput, and utilization are an important consideration in large supercomputing environments. Such machines have traditionally used space-sharing strategies to accommodate multiple jobs at the same time. This approach, however, can result in low system utilization and large job wait times. This paper discusses three techniques that can be used beyond simple space-sharing to greatly improve the performance figures of large parallel systems. The first technique we analyze is backfilling, the second is gang-scheduling, and the third is migration. The main contribution of this paper is an evaluation of the benefits from combining the above techniques. We demonstrate that, under certain conditions, a strategy that combines backfilling, gang-scheduling, and migration is always better than the individual strategies for all quality of service parameters that we consider.
UR - http://www.scopus.com/inward/record.url?scp=84944032891&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944032891&partnerID=8YFLogxK
U2 - 10.1007/3-540-45540-x_9
DO - 10.1007/3-540-45540-x_9
M3 - Conference contribution
AN - SCOPUS:84944032891
SN - 3540428178
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 133
EP - 158
BT - Job Scheduling Strategies for Parallel Processing - 7th International Workshop, JSSPP 2001, Revised Papers
A2 - Feitelson, Dror G.
A2 - Rudolph, Larry
PB - Springer Verlag
T2 - 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001
Y2 - 16 June 2001 through 16 June 2001
ER -