Adaptive variable sampling model for performance analysis in high cache-performance computing environments
Mincheol Shin1, Mucheol Kim1, Geunchul Park2
1Department of Computer Science and Engineering, Chung-Ang University, Seoul, South Korea.
Abstract:
High-performance computing provides computing power for a variety of scientific disciplines, supporting advancements by offering insights beyond metacognition. Maximizing computing performance without wasting resources is a major research issue. Predicting the performance of a computer's next state is effective for scheduling. However, hardware performance monitors representing the computer's state require high expert knowledge, and there is no standardized model. In this paper, we propose an adaptive variable sampling model for performance analysis in high-performance computing environments. Our method automatically classifies the optimal variables from numerous variables related to performance prediction and predicts performance using the sampled variables. The optimal variables for performance analysis do not require expert knowledge during the sampling process. We conducted experiments in various architectures and applications to validate this method. This model performed at least 24.25% and up to 58.75% faster without any loss in accuracy.
More Related Videos
10:52Multiscale Sampling of a Heterogeneous Water/Metal Catalyst Interface using Density Functional Theory and Force-Field Molecular Dynamics
Published on: April 12, 2019
12:11Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
Published on: April 8, 2020
Related Concept Videos
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Sampling Methods: Overview
In analytical chemistry, the choice of...
Ampere-Maxwell's Law: Problem-Solving
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of...
Sampling Plans
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
Parallel Processing
