Name
Abstract | ||
|---|---|---|
The estimate of a parallel job’s running time (walltime) is an important attribute used by resource managers and job schedulers in various scenarios, such as backfilling and short-job-first scheduling. This value is provided by the user, however, and has been repeatedly shown to be inaccurate. We studied the workload characteristic based on a large amount of historical data (over 275,000 jobs in two and a half years) from a production leadership-class computer. Based on that study, we proposed a set of walltime adjustment schemes producing more accurate estimates. To ensure the utility of these schemes on production systems, we analyzed their potential impact in scheduling and evaluated the schemes with an event-driven simulator. Our experimental results show that our method can achieve not only better overall estimation accuracy but also improved overall system performance. Specifically, the average estimation accuracy of the tested workload can be improved by up to 35%, and the system performance in terms of average waiting time and weighted average waiting time can be improved by up to 22% and 28%, respectively. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jpdc.2013.02.006 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Job scheduling,Runtime estimates,Walltime prediction | Computer science,Workload,Scheduling (computing),Parallel computing,Job scheduler,Rate-monotonic scheduling,Weighted arithmetic mean,Distributed computing | Journal |
Volume | Issue | ISSN |
73 | 7 | 0743-7315 |
Citations | PageRank | References |
9 | 0.55 | 26 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Tang | 1 | 152 | 10.65 |
| Narayan Desai | 2 | 319 | 29.73 |
| Daniel Buettner | 3 | 115 | 6.33 |
| Zhiling Lan | 4 | 818 | 54.25 |