Jeong-Geun Kim

Prof. Dr. Jeong-Geun Kim

Yonsei University
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
30 October 2019 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
JYJi-Tae Yun
Ji-Tae Yun
SYSu-Kyung Yoon
Su-Kyung Yoon
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
SKShin-Dug Kim
Shin-Dug Kim

29 May 2018 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
JYJi-Tae Yun
Ji-Tae Yun
SYSu-Kyung Yoon
Su-Kyung Yoon
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
BBBernd Burgstaller
Bernd Burgstaller
SKShin-Dug Kim
Shin-Dug Kim
This research is to design an effective hybrid main memory structure for graph processing applications, because it is quite expensive to use only high-speed DRAM for such applications. Thus, we propose a DRAM-PCM hybrid main memory structure to reduce the cost and energy consumption and design regression prefetch scheme to cope with irregular access patterns in large graph processing workloads. In addition, the prefetch includes preprocessing algorithm to maximize prefetching performance. Our experimental evaluation shows a performance improvement of 36 percent over a conventional DRAM model, 15 percent over existing prefetch models such as GHB/PC, SMS, and AMPM, and 6 percent over the latest model.

25 June 2018 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SLSung Min Lee
Sung Min Lee
SYSu-Kyung Yoon
Su-Kyung Yoon
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
SKShin-Dug Kim
Shin-Dug Kim

16 December 2020 in Electronics
Verified
Journal Article
Open access
PDF file
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
SKShin-Dug Kim
Shin-Dug Kim
SYSu-Kyung Yoon
Su-Kyung Yoon
This research is to design a Q-selector-based prefetching method for a dynamic random-access memory (DRAM)/ Phase-change memory (PCM)hybrid main memory system for memory-intensive big data applications generating irregular memory accessing streams. Specifically, the proposed method fully exploits the advantages of two-level hybrid memory systems, constructed as DRAM devices and non-volatile memory (NVM) devices. The Q-selector-based prefetching method is based on the Q-learning method, one of the reinforcement learning algorithms, which determines a near-optimal prefetcher for an application’s current running phase. For this, our model analyzes real-time performance status to set the criteria for the Q-learning method. We evaluate the Q-selector-based prefetching method with workloads from data mining and data-intensive benchmark applications, PARSEC-3.0 and graphBIG. Our evaluation results show that the system achieves approximately 31% performance improvement and increases the hit ratio of the DRAM-cache layer by 46% on average compared to a PCM-only main memory system. In addition, it achieves better performance results compared to the state-of-the-art prefetcher, access map pattern matching (AMPM) prefetcher, by 14.3% reduction of execution time and 12.89% of better CPI enhancement.

22 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SCSae-Gyeol Choi
Sae-Gyeol Choi
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
SKShin-Dug Kim
Shin-Dug Kim
The emergence of big data processing and machine learning has triggered the exponential growth of the working set sizes of applications. In addition, several modern applications are memory intensive with irregular memory access patterns. Therefore, we propose the concept of adaptive granularities to develop a prefetching methodology for analyzing memory access patterns based on a wider granularity concept that entails both cache lines and page granularity. The proposed prefetching module resides in the last-level cache (LLC) to handle the large working set of memory-intensive workloads. Additionally, to support memory access streams with variable intervals, we introduced an embedded-DRAM based LLC prefetch buffer that consists of three granularity-based prefetch engines and an access history table. By adaptively changing the granularity window for analyzing memory streams, the proposed model can swiftly and appropriately determine the stride of memory addresses to generate hidden delta chains from irregular memory access patterns. The proposed model achieves 18% and 15% improvements in terms of energy consumption and execution time compared to global history buffer and best offset prefetchers, respectively. In addition, our model reduced the total execution time and energy consumption by approximately 6% and 2.3%, compared to those of the Markov prefetcher and variable-length delta prefetcher.

26 October 2021 in IEEE Access
Verified
Journal Article
Open access
MKMin-Jae Kim
Min-Jae Kim
Jeong-Geun KimJeong-Geun Kim
Jeong-Geun Kim
SYSu-Kyung Yoon
Su-Kyung Yoon
SKShin-Dug Kim
Shin-Dug Kim
Processing-in-memory (PIM) architectures show the advantage of handling applications that generate complicated memory request patterns; usually, those kinds of memory streams degrade the application’s performance in conventional memory hierarchy systems. In particular, deep convolutional neural networks (DCNNs) processing that consists of several functionalities could be highly optimized if PIM cores can extend the processing capability and data accessibility. In this work, we propose a functionality-based PIM accelerator for DCNNs. We design several modules in addition to the conventional PIM system based on a hybrid memory cube (HMC). First, we compose a new buffer module, namely, a shared cache, in which PIM cores are provided DCNN functionalities and pre-trained weights. The PIM cores subsequently enhance computational utilization and data accessibility. Second, an efficient replacement method complements the shared cache to optimize the data miss rate of DCNN processing. Third, we compose dual prefetchers that can deal with DCNN’s memory access patterns, thereby reducing the system’s overall latency. Fourth, we compose a PIM scheduler for PIM core-level autonomous request control. The PIM scheduler relieves the host processor of significant computational loads, achieving the overall latency of the system and reducing the energy consumption. By the performance evaluation based on the trace-driven HMC simulator, our proposed model improves average latency and bandwidth by 38.9 and 27.9 % with only 18.7 % more energy consumption compared with conventional HMC-based PIM systems. Our system also achieves scalable processing performance because when the DCNN becomes deeper, it processes faster than conventional PIM systems.