Inhyuk Choi

Inhyuk Choi

Auto-generated profile, based on publicly available information

Inhyuk Choi

Seoul National University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
9 July 2023
Verified
Conference Paper
Open access
DLDusol Lee
Dusol Lee
ICInhyuk Choi
Inhyuk Choi
CLChanyoung Lee
Chanyoung Lee
SLSungjin Lee
Sungjin Lee
JKJihong Kim
Jihong Kim
We propose P2Cache, an application-directed kernel-level page cache that allows an application developer to build a custom kernel-level page cache that matches the I/O characteristics of a target application. P2Cache extends a Linux kernel page cache by adding new probe points that are used to support application-programmable kernel page caches by eBPF programs. Our experimental results show that custom page caches implemented with our P2Cache achieve up to 32% performance improvement in data-intensive graph applications with little effort.

9 January 2026 in ACM Transactions on Storage
Verified
Journal Article
Open access
DLDusol Lee
Dusol Lee
ICInhyuk Choi
Inhyuk Choi
CLChanyoung Lee
Chanyoung Lee
HJHyungsoo Jung
Hyungsoo Jung
JKJihong Kim
Jihong Kim
Data-centric applications perform tasks that require intensive data processing and ample memory resources. These tasks have varying I/O access patterns, significantly impacted by the OS cache. Therefore, it is desirable to enable application-specific cache management without compromising memory efficiency. However, infusing user-level policies into the OS cache management is challenging because it is difficult to communicate application-level I/O semantics and access patterns to general-purpose OSs. This article addresses the challenge by enabling applications to safely convey their I/O semantics to OSs via eBPF, allowing for more application-specific control over the OS cache. To this end, we introduce P2Cache , a programmable OS page cache. P2Cache extends the Linux page cache with three new probe points (i.e., eviction , prefetching , and swapping ) that can support application-directed custom policies on OS cache management using eBPF programs. Our experimental results showed that P2Cache significantly enhanced the performance of an LLM inference, a graph processing application, and a database by up to 230%, 49%, and 18%, respectively, with minimal effort.

22 March 2026
Verified
Conference Paper
Open access
MCMyoungjun Chun
Myoungjun Chun
JLJaeyong Lee
Jaeyong Lee
ICInhyuk Choi
Inhyuk Choi
JPJisung Park
Jisung Park
MKMyungsuk Kim
Myungsuk Kim
JKJihong Kim
Jihong Kim
While NAND flash memory has continuously increased its storage density over decades, this progress has exacerbated the read-disturbance problem. In this work, we identify two fundamental limitations of existing read-disturbance management techniques that trigger read reclaim (RR) at the block granularity: (i) they overlook the heterogeneous reliability impact of read disturbance across individual wordlines (WLs), leading to unnecessary RR in many cases; and (ii) they address read disturbance only after disturbance-induced errors have already accumulated, which forces substantial RR-induced copy overheads in read-disturbance-prone modern NAND flash memory. To address these limitations, we propose STRAW (STRess-Aware Wordline-based read-disturbance management), a new technique that minimizes RR overheads through two key ideas: (i) stress-aware WL-based read reclaim, which monitors the accumulated read-disturbance effect on each WL and reclaims only heavily disturbed WLs, and (ii) stress-reduced read, which mitigates disturbance on valid WLs during each read operation by scaling pass-through voltages based on WL validity. Our experimental results using a modern SSD emulator show that STRAW reduces RR-induced page-copy overhead by 88.6% on average compared with the state-of-the-art technique.