Advances in Aerodynamics | |
Predicting running time of aerodynamic jobs in HPC system by combining supervised and unsupervised learning method | |
Jie Yu1  Yong Dong2  Yi-Qin Dai2  Hao Wang2  | |
[1] China Aerodynamics Research and Development Center, Mianyang, China;College of Computer Science and Technology, National University of Defense Technology, Changsha, China; | |
关键词: High-performance computing; Job scheduling; Job running time prediction; Machine learning; Prediction accuracy; Underestimation rate; | |
DOI : 10.1186/s42774-021-00077-8 | |
来源: Springer | |
【 摘 要 】
Improving resource utilization is an important goal of high-performance computing systems of supercomputing centers. To meet this goal, the job scheduler of high-performance computing systems often uses backfilling scheduling to fill short-time jobs into job gaps at the front of the queue. Backfilling scheduling needs to obtain the running time of the job. In the past, the job running time is usually given by users and often far exceeded the actual running time of the job, which leads to inaccurate backfilling and a waste of computing resources. In particular, when the predicted job running time is lower than the actual time, the damage caused to the utilization of the system’s computing resources becomes more serious. Therefore, the prediction accuracy of the job running time is crucial to the utilization of system resources. The use of machine learning methods can make more accurate predictions of the job running time. Aiming at the parallel application of aerodynamics, we propose a job running time prediction framework SU combining supervised and unsupervised learning and verify it on the real historical data of the high-performance computing systems of China Aerodynamics Research and Development Center (CARDC). The experimental results show that SU has a high prediction accuracy (80.46%) and a low underestimation rate (24.85%).
【 授权许可】
CC BY
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202109174778172ZK.pdf | 1456KB | download |