Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Hyungwon Park 0001

dblp:32/4146-1 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
GPUs and heterogeneous computing · 40% Memory systems · 34% Cloud and datacenter computing · 17%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing
GPU memory management
1.012026
ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription · HPCA 2026
Cloud and datacenter computing › resource management › datacenter memory management
memory oversubscription
1.012026
ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription · HPCA 2026
Memory systems › memory management › virtual memory
page fault handling
1.012026
ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription · HPCA 2026
GPUs and heterogeneous computing › GPU memory management
unified virtual memory
1.012026
ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription · HPCA 2026
Memory systems
DRAM
0.512021
GreenDIMM: OS-assisted DRAM Power Management for DRAM with a Sub-array Granularity Power-Down State · MICRO 2021
Memory systems › DRAM
DRAM power management
0.512021
GreenDIMM: OS-assisted DRAM Power Management for DRAM with a Sub-array Granularity Power-Down State · MICRO 2021
Energy-efficient computing
power management
0.512021
GreenDIMM: OS-assisted DRAM Power Management for DRAM with a Sub-array Granularity Power-Down State · MICRO 2021
GPUs and heterogeneous computing
GPU runtime systems
0.312026
ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription · HPCA 2026

Methods — techniques the papers use, named apart from their topics

runtime metric (sharing degree) · 1.0prefetching · 1.0dynamic placement · 1.0
YearPublicationVenuePosition
2026 ARIADNE: Adaptive UVM Management for Efficient GPU Memory Oversubscription
abstract
Unified Virtual Memory (UVM) simplifies GPU programming and supports memory oversubscription, but suffers from severe performance degradation under high memory pressure due to page fault overhead and thrashing. Existing approaches such as prefetching, access counter-based migration, and dynamic Zero-copy offer limited benefits and often require hardware or compiler modifications, undermining UVM's portability and ease of deployment. We present ARIADNE, a runtime UVM management framework that preserves UVM's GPU memory abstraction while ensuring high and robust performance under memory oversubscription. ARIADNE is guided by three principles: (1) pipelined fault handling to hide migration latency, (2) Sharing Degree, a runtime metric that captures thread-level access locality without requiring hardware or compiler changes, to inform placement decisions, and (3) dynamic placement of memory regions between GPU memory and Zero-copy based on real-time access patterns. Implemented entirely within NVIDIA's UVM driver, ARIADNE requires no recompilation or hardware modifications and applies transparently to any executable or closed-source GPU UVM applications. Our experimental results show that ARIADNE delivers average speedups of$1.9 \times, 5.0 \times$, and$4.8 \times$over a state-of-the-art method at$\text{1 3 0 \%, ~} \text{1 7 5 \%}$, and 300 % oversubscription, respectively, while effectively preventing thrashing and maintaining near-linear performance scaling.
Hyunkyun Shin, Seongtae Bang, Hyungwon Park 0001, Daehoon Kim 0001
HPCA3
2021 GreenDIMM: OS-assisted DRAM Power Management for DRAM with a Sub-array Granularity Power-Down State
abstract
Power and energy consumed by DRAM comprising main memory of data-center servers have increased substantially as the capacity and bandwidth of memory increase. Especially, the fraction of DRAM background power in DRAM total power is already high, and it will continue to increase with the decelerating DRAM technology scaling as we will have to plug more DRAM modules in servers or stack more DRAM dies in a DRAM package to provide necessary DRAM capacity in the future. To reduce the background power, we may exploit low average utilization of the DRAM capacity in data-center servers (i.e., 40–60%) for DRAM power management. Nonetheless, the current DRAM power management supports low-power states only at the rank granularity, which becomes ineffective with memory interleaving techniques devised to disperse memory requests across ranks. That is, ranks need to be frequently woken up from low-power states with aggressive power management, which can significantly degrade system performance, or they do not get a chance to enter low-power states with conservative power management.
Seunghak Lee, Ki-Dong Kang, Hwanjun Lee, Hyungwon Park 0001, Young Hoon Son, Nam Sung Kim, Daehoon Kim 0001
MICRO4
2020 Improving the Efficiency of Power Management via Dynamic Interrupt Management
abstract
In this paper, we first analyze the effects of interrupt management on response latency of the latency-critical application and the efficiency of current dynamic power management governor which determines Voltage and Frequency States (V/F states) based on CPU utilization. We also demonstrate that interrupt management provides a governor an opportunity to decrease the V/F state without performance degradation. Next, we propose I-state that adjusts the interrupt rate based on the V/F state determined by the governor. When a core is highly utilized with a high V/F state, I-state improves response latency by decreasing interrupt rate, moderating the load on the CPU. I-state also improves energy-efficiency by making the governor decrease the V/F state more often. When a core is not highly utilized while operating at low V/F states, I-state improves response latency by increasing interrupt rate, which can notify the processor of packet arrivals faster so that the CPU processes the packets quickly. Our experimental results show that I-state improves 95thpercentile latency by up to 15.9x while reducing energy consumption by up to 17.6%.
Ki-Dong Kang, Hyungwon Park 0001, Gyeongseo Park, Daehoon Kim 0001
ICCD2