Yong Chen

Yong Chen

Auto-generated profile, based on publicly available information

Yong Chen

Department of Computer Science, Texas Tech University, Lubbock, TX, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2010 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
XSXian-He Sun
Xian-He Sun
YCYong Chen
Yong Chen

1 November 2008
Verified
Conference Paper
Closed access
SBSurendra Byna
Surendra Byna
YCYong Chen
Yong Chen
XSXian-He Sun
Xian-He Sun
RTRajeev Thakur
Rajeev Thakur
WGWilliam Gropp
William Gropp
Parallel I/O prefetching is considered to be effective in improving I/O performance. However, the effectiveness depends on determining patterns among future I/O accesses swiftly and fetching data in time, which is difficult to achieve in general. In this study, we propose an I/O signature-based prefetching strategy. The idea is to use a predetermined I/O signature of an application to guide prefetching. To put this idea to work, we first derived a classification of patterns and introduced a simple and effective signature notation to represent patterns. We then developed a toolkit to trace and generate I/O signatures automatically. Finally, we designed and implemented a thread-based client-side collective prefetching cache layer for MPI-IO library to support prefetching. A prefetching thread reads I/O signatures of an application and adjusts them by observing I/O accesses at runtime. Experimental results show that the proposed prefetching method improves I/O performance significantly for applications with complex patterns.

10 January 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JSJingwei Sun
Jingwei Sun
GSGuangzhong Sun
Guangzhong Sun
SZShiyan Zhan
Shiyan Zhan
JZJiepeng Zhang
Jiepeng Zhang
YCYong Chen
Yong Chen
Automated performance modeling and performance prediction of parallel programs are highly valuable in many use cases, such as in guiding task management and job scheduling, offering insights of application behaviors, and assisting resource requirement estimation. The performance of parallel programs is affected by numerous factors, including but not limited to hardware, applications, algorithms, and input parameters, thus an accurate performance prediction is often a challenging and daunting task. In this article, we focus on automatically predicting the execution time of parallel programs (more specifically, MPI programs) with different inputs, at different scales, and without domain knowledge. We model the correlation between the execution time and domain-independent runtime features. These features include values of variables, counters of branches, loops, and MPI communications. Through automatically instrumenting an MPI program, each execution of the program will output a feature vector and its corresponding execution time. After collecting data from executions with different inputs, a random forest machine learning approach is used to build an empirical performance model, which can predict the execution time of the program given a new input. A transfer learning method is used to reuse an existing performance model and improve the prediction accuracy on a new platform that lacks historical execution data. Our experiments and analyses of three parallel applications, Graph500, GalaxSee, and SMG2000, on three different systems confirm that our method performs well, with less than 20 percent prediction error on average.

10 May 2023
Verified
Book Chapter
Open access
PDF file
JLJie Li
Jie Li
GMGeorge Michelogiannakis
George Michelogiannakis
BCBrandon Cook
Brandon Cook
DCDulanya Cooray
Dulanya Cooray
YCYong Chen
Yong Chen
Resource demands of HPC applications vary significantly. However, it is common for HPC systems to primarily assign resources on a per-node basis to prevent interference from co-located workloads. This gap between the coarse-grained resource allocation and the varying resource demands can lead to HPC resources being not fully utilized. In this study, we analyze the resource usage and application behavior of NERSC’s Perlmutter, a state-of-the-art open-science HPC system with both CPU-only and GPU-accelerated nodes. Our one-month usage analysis reveals that CPUs are commonly not fully utilized, especially for GPU-enabled jobs. Also, around 64% of both CPU and GPU-enabled jobs used 50% or less of the available host memory capacity. Additionally, about 50% of GPU-enabled jobs used up to 25% of the GPU memory, and the memory capacity was not fully utilized in some ways for all jobs. While our study comes early in Perlmutter’s lifetime thus policies and application workload may change, it provides valuable insights on performance characterization, application behavior, and motivates systems with more fine-grain resource allocation.

8 June 2011
Verified
Conference Paper
Open access
PDF file
HSHuaiming Song
Huaiming Song
YYYanlong Yin
Yanlong Yin
YCYong Chen
Yong Chen
XSXian-He Sun
Xian-He Sun

1 September 2010
Verified
Conference Paper
Closed access
HJHui Jin
Hui Jin
YCYong Chen
Yong Chen
HZHuaiyu Zhu
Huaiyu Zhu
XSXian-He Sun
Xian-He Sun
The increasingly large ensemble size of modern High-Performance Computing (HPC) systems has drastically increased the possibility of failures. Performance under failures and its optimization become timely important issues facing the HPC community. In this study, we propose an analytical model to predict the application performance. The model characterizes the impact of coordinated checkpointing and system failures on application performance, considering all the factors including workload, the number of nodes, failure arrival rate, recovery cost, and checkpointing interval and overhead. Based on the model, we gauge three parameters, the number of compute nodes, checkpointing interval, and the number of spare nodes to conduct a comprehensive study of performance optimization under failures. Performance scalability under failures is also studied to explore the performance improvement space for different parameters. Experimental results from both synthetic and actual system failure logs confirm that the proposed model and optimization methodologies are effective and feasible.