Paper Info
Title
Parallel Job Scheduling under Dynamic Workloads
Abstract
Jobs that run on parallel systems that use gang scheduling for multiprogramming may interact with each other in various ways. These interactions are affected by system parameters such as the level of multiprogramming and the scheduling time quantum. A careful evaluation is therefore required in order to find parameter values that lead to optimal performance. We perform a detailed performance evaluation of three factors affecting scheduling systems running dynamic workloads; multiprogramming level, time quantum, and the use of backfilling for queue management - and how they depend on offered load. Our evaluation is based on synthetic MPI applications running on a real cluster that actually implements the various scheduling schemes. Our results demonstrate the importance of both components of the gang-scheduling plus backfilling combination: gang scheduling reduces response time and slowdown, and backfilling allows doing so with a limited multiprogramming level. This is further improved by using flexible coscheduling rather than strict gang scheduling, as this reduces the constraints and allows for a denser packing.
Year
DOI
Venue
2003
10.1007/10968987_11
LECTURE NOTES IN COMPUTER SCIENCE
Keywords
Field
DocType
cluster computing,dynamic workloads,job scheduling,gang scheduling,parallel architectures,heterogeneous clusters,STORM,flexible coscheduling
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Coscheduling,Parallel computing,Gang scheduling,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing
Conference
Volume
ISSN
Citations 
2862
0302-9743
17
PageRank 
References 
Authors
1.23
21
4
Name
Order
Citations
PageRank
Eitan Frachtenberg1106085.08
Dror G. Feitelson23997381.74
Juan Fernandez326923.17
Fabrizio Petrini42050165.82