I/O-signature-based feature analysis and classification of high-performance computing applications

被引:1
|
作者
Park, Ju-Won [1 ]
Huang, Xin [2 ]
Lee, Jae-Kook [1 ]
Hong, Taeyoung [1 ]
机构
[1] Korea Inst Sci & Technol Informat, 245 Daehak Ro, Daejeon 34141, South Korea
[2] Texas State Univ, Dept Comp Sci, San Marcos, TX 78666 USA
关键词
I/O patterns analysis; Key features; High performance computing;
D O I
10.1007/s10586-023-04139-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The demand for high-performance computing (HPC) resources in computing fields such as machine learning has increased significantly in recent years. Computing power has been growing exponentially to keep up with this demand. However, these gains have not been able to translate to performance improvement in real-world applications. One of the biggest reasons for this is performance degradation in terms of input/output (I/O) due to the increased storage latency and complex parallel I/O architecture of accessing data in distributed storage systems. In this study, we analyze application-specific I/O patterns to gain a deeper understanding of I/O throughput and the interaction between applications and the I/O system. Specifically, we analyze the importance of each feature of I/O patterns through feature analysis based on the collected monitoring information. We also investigate the feasibility of identifying the application based on the analyzed key features. To this end, we present the analysis accuracy and confusion matrix of four algorithms, including random forest, which are widely used as classification algorithms in the experimental results. The experiment results confirm that we can distinguish applications with an accuracy of more than 90% by using application-specific I/O patterns.
引用
收藏
页码:3219 / 3231
页数:13
相关论文
共 50 条
  • [21] Benchmarking Classification Algorithms on High-Performance Computing Clusters
    Bischl, Bernd
    Schiffner, Julia
    Weihs, Claus
    DATA ANALYSIS, MACHINE LEARNING AND KNOWLEDGE DISCOVERY, 2014, : 23 - 31
  • [22] Modeling I/O performance variability in high-performance computing systems using mixture distributions
    Xu, Li
    Wang, Yueyao
    Lux, Thomas
    Chang, Tyler
    Bernard, Jon
    Li, Bo
    Hong, Yili
    Cameron, Kirk
    Watson, Layne
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2020, 139 : 87 - 98
  • [23] High-Throughput Computing Versus High-Performance Computing for Groundwater Applications
    Fienen, Michael N.
    Hunt, Randall J.
    GROUNDWATER, 2015, 53 (02) : 180 - 184
  • [24] Feature selection with a deep learning based high-performance computing model for traffic flow analysis of Twitter data
    B. Mounica
    K. Lavanya
    The Journal of Supercomputing, 2022, 78 : 15107 - 15122
  • [25] Feature selection with a deep learning based high-performance computing model for traffic flow analysis of Twitter data
    Mounica, B.
    Lavanya, K.
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (13): : 15107 - 15122
  • [26] Interpretable Model-Agnostic Explanations Based on Feature Relationships for High-Performance Computing
    Chen, Zhouyuan
    Lian, Zhichao
    Xu, Zhe
    AXIOMS, 2023, 12 (10)
  • [27] Optimization of checkpointing-related I/O for high-performance parallel and distributed computing
    Subramaniyan, Rajagopal
    Grobelny, Eric
    Studham, Scott
    George, Alan D.
    JOURNAL OF SUPERCOMPUTING, 2008, 46 (02): : 150 - 180
  • [28] Optimization of checkpointing-related I/O for high-performance parallel and distributed computing
    Rajagopal Subramaniyan
    Eric Grobelny
    Scott Studham
    Alan D. George
    The Journal of Supercomputing, 2008, 46 : 150 - 180
  • [29] Industrial applications of high-performance computing for phylogeny reconstruction
    Bader, DA
    Moret, BME
    Vawter, L
    COMMERCIAL APPLICATIONS FOR HIGH-PERFORMANCE COMPUTING, 2001, 4528 : 159 - 168
  • [30] High-performance computing and networking enables complex applications
    Afsarmanesh, H
    Bubak, M
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, 2001, 17 (08): : V - VI