Title
Using Historical Data to Predict Application Runtimes on Backfilling Parallel Systems
Abstract
We present in this paper a novel method to predict application runtimes on backfilling parallel systems. The method is based on mining historical data to obtain important parameters. These parameters are then applied to predict the runtime of future applications. It has been shown in previous works that both underestimate and inaccuracy in prediction have adverse impacts on scheduling performance of backfilling systems. In our study, we try to reduce the number of jobs that are underestimated and reduce the prediction error as much as possible. Comparing with other predictors, experimental results show that our predictor is up to 25% better with respect to the problem of underestimate. Moreover, using the metric proposed in for the accuracy, our predictor improves up to 32%.
Year
DOI
Venue
2010
10.1109/PDP.2010.18
PDP
Keywords
Field
DocType
application runtimes prediction,parallel processing,parallel system,adverse impact,important parameter,novel method,future application,parallel systems,backfilling system,runtime prediction,prediction error,data mining,historical data mining,application runtimes,backfilling parallel system,backfilling parallel systems,predict application runtimes,historical data,mathematical model,measurement,databases
Data mining,Mean squared prediction error,Runtime prediction,Computer science,Scheduling (computing),Parallel computing,Parallel processing
Conference
ISSN
ISBN
Citations 
1066-6192 E-ISBN : 978-1-4244-5673-4
978-1-4244-5673-4
7
PageRank 
References 
Authors
0.46
11
2
Name
Order
Citations
PageRank
Ngoc Minh Tran1595.08
Lex Wolters262542.33