Changmin Shin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Changmin Shin has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jinho Lee
Seoul National University
6 shared publications - Jaeyong Song
Seoul National University, Seoul, Republic of Korea
4 shared publications - Hongsun Jang
Seoul National University, Seoul, Republic of Korea
2 shared publications - Dain Kwon
Seoul National University
1 shared publication Dookyung Kang
Seoul National University
1 shared publication- Frank Liu
Oak Ridge National Laboratory
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
SePArate: Segmenting Patterns from Defects in Wafer Manufacturing Using Weak Supervision
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessSePArate: Segmenting Patterns from Defects in Wafer Manufacturing Using Weak Supervision
- 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
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1499-1514
FlexiWalker: Extensible GPU Framework for Efficient Dynamic Random Walks with Runtime Adaptation
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1499-1514
Open AccessFlexiWalker: Extensible GPU Framework for Efficient Dynamic Random Walks with Runtime Adaptation
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 5-24
A Cost-Effective Near-Storage Processing Solution for Offline Inference of Long-Context LLMs
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 5-24
Open AccessA Cost-Effective Near-Storage Processing Solution for Offline Inference of Long-Context LLMs
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1520-1534
FALA: Locality-Aware PIM-Host Cooperation for Graph Processing with Fine-Grained Column Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1520-1534
Open AccessFALA: Locality-Aware PIM-Host Cooperation for Graph Processing with Fine-Grained Column Access
- 13 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 73-77
A Case for In-Memory Random Scatter-Gather for Fast Graph Processing
Because of the widely recognized memory wall issue, modern DRAMs are increasingly being assigned innovative functionalities beyond the basic read and write operations. Often referred to as “function-inmemory”, these techniques are crafted to leverage the abundant internal bandwidth available within the DRAM. However, these techniques face several challenges, including requiring large areas for arithmetic units and the necessity of splitting a single word into multiple pieces. These challenges severely limit the practical application of these functionin- memory techniques. In this paper, we present Piccolo , an efficient design of random scatter-gather memory. Our method achieves significant improvements with minimal overhead. By demonstrating our technique on a graph processing accelerator, we show that Piccolo and the proposed accelerator achieves $1.2-3.1 \times$ speedup compared to the prior art.
- 13 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 73-77
A Case for In-Memory Random Scatter-Gather for Fast Graph Processing
Because of the widely recognized memory wall issue, modern DRAMs are increasingly being assigned innovative functionalities beyond the basic read and write operations. Often referred to as “function-inmemory”, these techniques are crafted to leverage the abundant internal bandwidth available within the DRAM. However, these techniques face several challenges, including requiring large areas for arithmetic units and the necessity of splitting a single word into multiple pieces. These challenges severely limit the practical application of these functionin- memory techniques. In this paper, we present Piccolo , an efficient design of random scatter-gather memory. Our method achieves significant improvements with minimal overhead. By demonstrating our technique on a graph processing accelerator, we show that Piccolo and the proposed accelerator achieves $1.2-3.1 \times$ speedup compared to the prior art.