Loading...
Please wait, while we are loading the content...
Similar Documents
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Smith, Warren Foster, Ian Taylor, Valerie |
| Abstract | On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this paper, we build on run-time prediction techniques that we developed in previous research to explore two problems. The first problem is to predict how long applications will wait in a queue until they receive resources. We show that run-time estimates can be used for this and that using our run-time estimates result in more accurate wait-time predictions than when the run-time prediction techniques of other researches are used. The second problem we investigate is improving scheduling performance. We use run-time predictions to improve the performance of the least work first and backfill scheduling algorithms. We find that using our run-time predictor results in lower mean wait times for the workloads with higher offered loads when compared to alternative run-time predictors. 1 Introduction On many high-performan... |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Content Type | Text |
