ChanYeol Park
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
ChanYeol Park has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Heonchang Yu
Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea
3 shared publications - JunWeon Yoon
Korea Institute of Science and Technology Information, Daejeon, Republic of Korea
3 shared publications - Taeyoung Hong
Korea Institute of Science and Technology Information, Daejeon, Republic of Korea
3 shared publications - Geunchul Park
National Institute of Supercomputing and Networking, Korea Institute of Science and Technology Information, Daejeon, Republic of Korea
2 shared publications - Chan-Myung Kim
Korea University of Technology and Education
1 shared publication - Hyunjoon Cheon
Department of Computer Science, Yonsei University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- 22 April 2021
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 2629-2641
ARED: automata-based runtime estimation for distributed systems using deep learning
- 22 April 2021
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 2629-2641
ARED: automata-based runtime estimation for distributed systems using deep learning
- 1 March 2021
- Published by Springer Nature in Cluster Computing
- Vol. 24 (1) , 159-179
Development of benchmark automation suite and evaluation of various high-performance computing systems
- 1 March 2021
- Published by Springer Nature in Cluster Computing
- Vol. 24 (1) , 159-179
Development of benchmark automation suite and evaluation of various high-performance computing systems
- 4 January 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (7) , 6817-6831
Application-specific feature selection and clustering approach with HPC system profiling data
- 4 January 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (7) , 6817-6831
Application-specific feature selection and clustering approach with HPC system profiling data
- Open Access
- 10 April 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (7) , 2634
Log Analysis-Based Resource and Execution Time Improvement in HPC: A Case Study
High-performance computing (HPC) uses many distributed computing resources to solve large computational science problems through parallel computation. Such an approach can reduce overall job execution time and increase the capacity of solving large-scale and complex problems. In the supercomputer, the job scheduler, the HPC’s flagship tool, is responsible for distributing and managing the resources of large systems. In this paper, we analyze the execution log of the job scheduler for a certain period of time and propose an optimization approach to reduce the idle time of jobs. In our experiment, it has been found that the main root cause of delayed job is highly related to resource waiting. The execution time of the entire job is affected and significantly delayed due to the increase in idle resources that must be ready when submitting the large-scale job. The backfilling algorithm can optimize the inefficiency of these idle resources and help to reduce the execution time of the job. Therefore, we propose the backfilling algorithm, which can be applied to the supercomputer. This experimental result shows that the overall execution time is reduced.
- 10 April 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (7) , 2634
Open AccessLog Analysis-Based Resource and Execution Time Improvement in HPC: A Case Study
High-performance computing (HPC) uses many distributed computing resources to solve large computational science problems through parallel computation. Such an approach can reduce overall job execution time and increase the capacity of solving large-scale and complex problems. In the supercomputer, the job scheduler, the HPC’s flagship tool, is responsible for distributing and managing the resources of large systems. In this paper, we analyze the execution log of the job scheduler for a certain period of time and propose an optimization approach to reduce the idle time of jobs. In our experiment, it has been found that the main root cause of delayed job is highly related to resource waiting. The execution time of the entire job is affected and significantly delayed due to the increase in idle resources that must be ready when submitting the large-scale job. The backfilling algorithm can optimize the inefficiency of these idle resources and help to reduce the execution time of the job. Therefore, we propose the backfilling algorithm, which can be applied to the supercomputer. This experimental result shows that the overall execution time is reduced.
- 27 March 2018
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 11 (6) , 1206-1216
Evaluation of P2P and cloud computing as platform for exhaustive key search on block ciphers
- 27 March 2018
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 11 (6) , 1206-1216
Evaluation of P2P and cloud computing as platform for exhaustive key search on block ciphers
- 20 December 2017
- Published by Springer Nature
- p. 1134-1140
Accelerated Purge Processes of Parallel File System on HPC by Using MPI Programming
- 20 December 2017
- Published by Springer Nature
- p. 1134-1140
Accelerated Purge Processes of Parallel File System on HPC by Using MPI Programming
- 1 January 2015
- Published by Springer Nature
- p. 1017-1023
Stable HPC Cluster Management Scheme through Performance Evaluation
- 1 January 2015
- Published by Springer Nature
- p. 1017-1023
Stable HPC Cluster Management Scheme through Performance Evaluation
- 20 November 2012
- Published by Springer Nature
- p. 745-751
A Community Detection Scheme in Delay-Tolerant Networks
- 20 November 2012
- Published by Springer Nature
- p. 745-751
A Community Detection Scheme in Delay-Tolerant Networks