Predicting the job running time with job name hierarchical clustering algorithm
CSTR:
Author:
Affiliation:

(1. Computational Aerodynamics Institute, China Aerodynamics Research and Development Center, Mianyang 621000, China;2. School of Computer Science and Technology, Southwest University of Science and Technology, Mianyang 621010, China;3. College of Computer Science and Technology, National University of Defense Technology, Changsha 410073, China;4. National Supercomputer Center in Tianjin, Tianjin 300457, China;5. School of Computer Science and Engineering, Sichuan University of Science & Engineering, Zigong 643000, China)

Clc Number:

TN95

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Predicting the job running time is beneficial to improve the scheduling performance of the system, and the clustering can help to train better prediction models. Traditional clustering algorithms are difficult to cluster similar job names. In order to better cluster similar jobs, the job name hierarchical clustering algorithm of letter-structure-number was constructed by analyzing the semantic importance of their components. Taking the real data of two supercomputers as an example, the data clustered by this algorithm was used to train the model. The experimental results show that the prediction accuracy of the model is better than that of the traditional method, and the overall prediction accuracy is 70%~80%.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 28,2021
  • Revised:
  • Adopted:
  • Online: September 28,2022
  • Published: October 28,2022
Article QR Code