Seonggyun Oh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Seonggyun Oh has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Sungjin Lee
Pohang University of Science and Technology, Pohang, Gyeongsangbuk-do, Republic of Korea
4 shared publications - Bryan Suk Joon Kim
Syracuse University
2 shared publications - Jinhyung Koo
POSTECH, Republic of Korea
2 shared publications - Juhyung Park
Daegu Gyeongbuk Institute of Science and Technology
2 shared publications - Jungwoo Kim
DGIST
2 shared publications - Yeseong Kim
POSTECH, Pohang, Republic of Korea
2 shared publications
Latest Publications
- Open Access
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (2) , 351-354
Packet-Level CXL.cache Analysis With ${\sf OpenCIS}$- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (2) , 351-354
Open AccessPacket-Level CXL.cache Analysis With ${\sf OpenCIS}$ - Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 974-990
Solid State Drive Targeted Memory-Efficient Indexing for Universal I/O Patterns and Fragmentation Degrees
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 974-990
Open AccessSolid State Drive Targeted Memory-Efficient Indexing for Universal I/O Patterns and Fragmentation Degrees
- Open Access
- 27 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 689-707
NDPipe: Exploiting Near-data Processing for Scalable Inference and Continuous Training in Photo Storage
This paper proposes a novel photo storage system called NDPipe, which accelerates the performance of training and inference for image data by leveraging near-data processing in photo storage servers. NDPipe distributes storage servers with inexpensive commodity GPUs in a data center and uses their collective intelligence to perform inference and training near image data. By efficiently partitioning deep neural network (DNN) models and exploiting the data parallelism of many storage servers, NDPipe can achieve high training throughput with low synchronization costs. NDPipe optimizes the near-data processing engine to maximally utilize system components in each storage server. Our results show that, given the same energy budget, NDPipe exhibits 1.39× higher inference throughput and 2.64× faster training speed than typical photo storage systems.
- 27 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 689-707
Open AccessNDPipe: Exploiting Near-data Processing for Scalable Inference and Continuous Training in Photo Storage
This paper proposes a novel photo storage system called NDPipe, which accelerates the performance of training and inference for image data by leveraging near-data processing in photo storage servers. NDPipe distributes storage servers with inexpensive commodity GPUs in a data center and uses their collective intelligence to perform inference and training near image data. By efficiently partitioning deep neural network (DNN) models and exploiting the data parallelism of many storage servers, NDPipe can achieve high training throughput with low synchronization costs. NDPipe optimizes the near-data processing engine to maximally utilize system components in each storage server. Our results show that, given the same energy budget, NDPipe exhibits 1.39× higher inference throughput and 2.64× faster training speed than typical photo storage systems.
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 784-799
All-Flash Array Key-Value Cache for Large Objects
We present BigKV, a key-value cache specifically designed for caching large objects in an all-flash array (AFA). The design of BigKV is centered around the unique property of a cache: since it contains a copy of the data, exact bookkeeping of what is in the cache is not critical for correctness. By ignoring hash collisions, approximating metadata information, and allowing data loss from failures, BigKV significantly increases the cache hit ratio and keeps more useful objects in the system. Experiments on a real AFA show that our design increases the throughput by 3.1× on average and reduces the average and tail latency by 57% and 81%, respectively.
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 784-799
Open AccessAll-Flash Array Key-Value Cache for Large Objects
We present BigKV, a key-value cache specifically designed for caching large objects in an all-flash array (AFA). The design of BigKV is centered around the unique property of a cache: since it contains a copy of the data, exact bookkeeping of what is in the cache is not critical for correctness. By ignoring hash collisions, approximating metadata information, and allowing data loss from failures, BigKV significantly increases the cache hit ratio and keeps more useful objects in the system. Experiments on a real AFA show that our design increases the throughput by 3.1× on average and reduces the average and tail latency by 57% and 81%, respectively.