Predicting Application Run Times Using Historical Information

We present a technique for deriving predictions for the run times of parallel applications from the run times of "similar " applications that have executed in the past. The novel aspect of our work is the use of search techniques to determine those application characteristics that yield the best definition of similarity for the purpose of making predictions. We use four workloads recorded from parallel computers at Argonne National Laboratory, the Cornell Theory Center, and the San Diego Supercomputer Center to evaluate the effectiveness of our approach. We show that on these workloads our techniques achieve predictions that are between 14 and 60 percent better than those achieved by other researchers; our approach achieves mean prediction errors that are between 41 and 65 percent of mean application run times. 1 Introduction Predictions of application run time can be used to improve the performance of scheduling algorithms [8] and to predict how long a request will wait for resources..