Title :
Online prediction of the running time of tasks
Author_Institution :
Dept. of Comput. Sci., Northwestern Univ., Evanston, IL, USA
Abstract :
We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host. The prediction is computed from linear time series predictions of host load and takes the form of a confidence interval that neatly expresses the error associated with the measurement and prediction processes, error that must be captured to make statistically valid decisions based on the predictions. Adaptive applications make such decisions in pursuit of consistent high performance, choosing, for example, the host where a task is most likely to meet its deadline. We begin by describing the system and summarizing the results of our previously published work on host load prediction (P.A. Dinda, 1999; 2000)We then describe our algorithm for computing predictions of running time from host load predictions. Finally, we evaluate the system using over 100000 randomized testcases run on 39 different hosts
Keywords :
adaptive systems; performance evaluation; scheduling; shared memory systems; time series; Running Time Advisor; adaptive applications; compute-bound task; confidence interval; host load; host load prediction; linear time series predictions; online prediction; prediction processes; randomized testcases; shared unreserved commodity host; statistically valid decisions; task running time; Application software; Computer applications; Computer science; Distributed computing; Prediction algorithms; Processor scheduling; System testing; Time measurement; Time sharing computer systems; Visualization;
Conference_Titel :
High Performance Distributed Computing, 2001. Proceedings. 10th IEEE International Symposium on
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7695-1296-8
DOI :
10.1109/HPDC.2001.945206