A Preliminary Study of Neural Network-based Approximation for HPC Applications

2018/12/18 by Wenqian Dong, Dong, Wenqian, Anzheng Guolu +3
Computer Science · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Performance (cs.PF) #cs.LG #cs.PF

paper · pdf · doi:10.48550/arxiv.1812.07561

arxiv created 2018/12/18 · arxiv updated 2018/12/19

Abstract

Machine learning, as a tool to learn and model complicated (non)linear relationships between input and output data sets, has shown preliminary success in some HPC problems. Using machine learning, scientists are able to augment existing simulations by improving accuracy and significantly reducing latencies. Our ongoing research work is to create a general framework to apply neural network-based models to HPC applications. In particular, we want to use the neural network to approximate and replace code regions within the HPC application to improve performance (i.e., reducing the execution time) of the HPC application. In this paper, we present our preliminary study and results. Using two applications (the Newton-Raphson method and the Lennard-Jones (LJ) potential in LAMMP) for our case study, we achieve up to 2.7x and 2.46x speedup, respectively.

Related

• Understanding ML driven HPC: Applications and Infrastructure
• Deep-learning enhancement of large scale numerical simulations
• On the Relationships between Graph Neural Networks for the Simulation of Physical Systems and Classical Numerical Methods
• ParaGraph: Weighted Graph Representation for Performance Optimization of HPC Kernels
• Deploying Customized Data Representation and Approximate Computing in Machine Learning Applications