Performance analysis of job scheduling policies in parallel supercomputing environments
Conference
·
OSTI ID:46276
- IBM T.J. Watson Research Center, Yorktown Heights, NY (United States)
- George Mason Univ., Fairfax, VA (United States). Dept. of Computer Science
In this paper the authors analyze three general classes of scheduling policies under a workload typical of largescale scientific computing. These policies differ in the manner in which processors are partitioned among the jobs as well as the way in which jobs are prioritized for execution on the partitions. Their results indicate that existing static schemes do not perform well under varying workloads. Adaptive policies tend to make better scheduling decisions, but their ability to adjust to workload changes is limited. Dynamic partitioning policies, on the other hand, yield the best performance and can be tuned to provide desired performance differences among jobs with varying resource demands.
- OSTI ID:
- 46276
- Report Number(s):
- CONF-931115--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Adaptive Parallel Job Scheduling with Flexible CoScheduling
Parallel job scheduling policies to improve fairness : a case study.
SchedInspector: A Batch Job Scheduling Inspector Using Reinforcement Learning
Journal Article
·
Mon Oct 31 23:00:00 EST 2005
· IEEE Transactions on Parallel and Distributed Systems, 16(11):1066-1077
·
OSTI ID:918866
Parallel job scheduling policies to improve fairness : a case study.
Technical Report
·
Thu Jan 31 23:00:00 EST 2008
·
OSTI ID:929521
SchedInspector: A Batch Job Scheduling Inspector Using Reinforcement Learning
Conference
·
Wed Jun 01 00:00:00 EDT 2022
·
OSTI ID:1885384