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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hyunkyun Shin

dblp:409/0931 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0000-3105-7286ORCID · reported

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

Systems, architecture and hardware · 1 · 1 first-author · 1 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
1 paper
GPUs and heterogeneous computing · 54% Cloud and datacenter computing · 23% Memory systems · 23%

Topics — the 5 heaviest of 5, 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
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
HPCA1