Hyeonu Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hyeonu Kim has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Eojin Lee
Inha University, Incheon, Republic of Korea
4 shared publications - Seunghyuk Yu
Inha University, Incheon, Republic of Korea
3 shared publications - Hyojin Sung
Seoul National University, Seoul, Republic of Korea
2 shared publications - Kyoungho Jeun
Inha University, Incheon, Republic of Korea
2 shared publications - Sunyoung Hwang
Inha University, Incheon, Republic of Korea
2 shared publications - Changmin Shin
Seoul National University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 893-905
Aurora: A Disaggregated GPU-PNM-PIM System for High-Throughput Mixed-Length LLM Inference
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 893-905
Open AccessAurora: A Disaggregated GPU-PNM-PIM System for High-Throughput Mixed-Length LLM Inference
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (2) , 303-306
PLUG: P rocessing-in-Memory LU T Gathering for G raph ANNS
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (2) , 303-306
PLUG: P rocessing-in-Memory LU T Gathering for G raph ANNS
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 49-62
ComPASS: A Compatible PIM Protocol Architecture and Scheduling Solution for Processor-PIM Collaboration
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 49-62
Open AccessComPASS: A Compatible PIM Protocol Architecture and Scheduling Solution for Processor-PIM Collaboration
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (1) , 185-188
Fold-PIM: A Cost-Efficient LPDDR5-Based PIM for On-Device SLMs
The increasing demand for on-device AI applications has shifted focus to Small Language Models (SLMs) optimized for mobile environments. However, the limited memory bandwidth of LPDDR5-based systems presents significant challenges for efficiently executing memory-bound matrix-vector multiplication operations, a core component of SLM inference. In this paper, we propose Fold-PIM, an LPDDR5-based Processing-in-Memory (PIM) architecture designed to address these challenges. FoldPIM features a shared PU architecture that leverages subarray level parallelism while maintaining cost efficiency. Additionally, we introduce key techniques, including adaptive tiling for efficient GEMV operations across diverse matrix sizes, a transposed data layout to minimize buffer overhead, and a tailored protocol to reduce vector replacement latency. Our evaluation results demonstrate that Fold-PIM achieves up to 3.9× speedup of token generation time in SLM inference compared to the baseline system without PIM.
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (1) , 185-188
Fold-PIM: A Cost-Efficient LPDDR5-Based PIM for On-Device SLMs
The increasing demand for on-device AI applications has shifted focus to Small Language Models (SLMs) optimized for mobile environments. However, the limited memory bandwidth of LPDDR5-based systems presents significant challenges for efficiently executing memory-bound matrix-vector multiplication operations, a core component of SLM inference. In this paper, we propose Fold-PIM, an LPDDR5-based Processing-in-Memory (PIM) architecture designed to address these challenges. FoldPIM features a shared PU architecture that leverages subarray level parallelism while maintaining cost efficiency. Additionally, we introduce key techniques, including adaptive tiling for efficient GEMV operations across diverse matrix sizes, a transposed data layout to minimize buffer overhead, and a tailored protocol to reduce vector replacement latency. Our evaluation results demonstrate that Fold-PIM achieves up to 3.9× speedup of token generation time in SLM inference compared to the baseline system without PIM.
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (2) , 183-186
Architecting Compatible PIM Protocol for CPU-PIM Collaboration
Processing in Memory (PIM) technology is gaining traction with the introduction of several prototype products. However, the interfaces of existing PIM devices hinder CPU performance excessively by delaying normal memory requests for long periods during PIM operations. In this paper, we propose a new PIM command and protocol designed for compatibility across various PIM devices and host processors, focusing on DRAM standards with limited command space. Our proposed command, PIM-ACT, activates multiple banks simultaneously with assigning the specific PIM operation. It closely follows the functionality of the ACT command for straightforward control by the memory controller. We also explore memory scheduling policies that balance the latency of conventional memory requests with the throughput of PIM workloads. Our evaluation demonstrates the effectiveness of our approach in optimizing both PIM and conventional workload performance.
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (2) , 183-186
Architecting Compatible PIM Protocol for CPU-PIM Collaboration
Processing in Memory (PIM) technology is gaining traction with the introduction of several prototype products. However, the interfaces of existing PIM devices hinder CPU performance excessively by delaying normal memory requests for long periods during PIM operations. In this paper, we propose a new PIM command and protocol designed for compatibility across various PIM devices and host processors, focusing on DRAM standards with limited command space. Our proposed command, PIM-ACT, activates multiple banks simultaneously with assigning the specific PIM operation. It closely follows the functionality of the ACT command for straightforward control by the memory controller. We also explore memory scheduling policies that balance the latency of conventional memory requests with the throughput of PIM workloads. Our evaluation demonstrates the effectiveness of our approach in optimizing both PIM and conventional workload performance.