Name
Abstract | ||
|---|---|---|
Traditionally, many science fields require great support for a massive workflow, which utilizes multiple cores simultaneously. In order to support such large-scale scientific workflows, high-capacity parallel systems such as supercomputers are widely used. To increase the utilization of these systems, most schedulers use backfilling policy based on user’s estimated runtime. However, it is found to be extremely inaccurate because users overestimate their jobs. Therefore, in this paper, an efficient machine learning approach is present to predict the runtime of parallel application. The proposed method is divided into three phases. First is to analyze important feature of the history log data by factor analysis. Second is to carry out clustering for the parallel program based on the important features. Third is to build a prediction models by pattern similarity of parallel program log data and estimate runtime. In the experiments, we use workload logs on parallel systems (i.e., NASA-iPSC, LANL-CM5, SDSC-Par95, SDSC-Par96, and CTC-SP2) to evaluate the effectiveness of our approach. Comparing root-mean-square error with other techniques, experimental results show that the proposed method improves the accuracy up to 69.56%. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s11227-017-2038-2 | The Journal of Supercomputing |
Keywords | Field | DocType |
Runtime prediction,Workload-aware clustering,Support vector regression,Machine learning approach | Data mining,Workload,Runtime prediction,Computer science,Support vector machine,Parallel computing,Runtime verification,Predictive modelling,Cluster analysis,Workflow,Distributed computing | Journal |
Volume | Issue | ISSN |
73 | 11 | 0920-8542 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ju-Won Park | 1 | 19 | 5.09 |
| Eun-Hye Kim | 2 | 19 | 10.40 |