Online prediction of the running time of tasks

Peter A Dinda*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

17 Scopus citations

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. We then describe our algorithm for computing predictions of running time from host load predictions. Finally, we evaluate the system using over 100,000 randomized testcases run on 39 different hosts.

Original languageEnglish (US)
Pages (from-to)383-394
Number of pages12
JournalIEEE International Symposium on High Performance Distributed Computing, Proceedings
StatePublished - Jan 1 2001
Event10th IEEE Interantionsl Symposium on High Performance Distributed Computing - San Francisco, CA, United States
Duration: Aug 7 2001Aug 9 2001

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Online prediction of the running time of tasks'. Together they form a unique fingerprint.

Cite this