Sciweavers

535 search results - page 1 / 107
» Predicting Application Run Times Using Historical Informatio...
Sort
View
JSSPP
1998
Springer
13 years 9 months ago
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. T...
Warren Smith, Ian T. Foster, Valerie E. Taylor
ICCS
2004
Springer
13 years 10 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...
JSSPP
2005
Springer
13 years 10 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
CLUSTER
2003
IEEE
13 years 10 months ago
Run-Time Prediction of Parallel Applications on Shared Environments
Application run-time information is a fundamental component in application and job scheduling. However, accurate predictions of run times are difficult to achieve for parallel app...
Byoung-Dai Lee, Jennifer M. Schopf