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

Jaeyoon Nam

dblp:422/9432 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0008-4268-5112ORCID · reported

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

Systems, architecture and hardware · 1 · 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
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory disaggregation
0.912025
Disaggregated Memory for File-backed Pages · ACM Trans. Storage 2025
Memory systems › cache management › storage caching
page cache
0.912025
Disaggregated Memory for File-backed Pages · ACM Trans. Storage 2025

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

two-sided RDMA · 0.9one-sided RDMA · 0.9RDMA · 0.9
YearPublicationVenuePosition
2025 Disaggregated Memory for File-backed Pages
abstract
To explore the opportunity of expanding the page cache using disaggregated memory for file-backed pages, this study presents BalloonStasher, an RDMA-based disaggregated memory for data-intensive applications. Utilizing the ephemeral nature of the page cache, BalloonStasher dynamically adapts to the changing page cache demands of multiple clients. BalloonStasher supports one-sided RDMA-based memory pooling or two-sided RDMA-based memory sharing when using memory nodes. Additionally, it also supports peer memory mode, which utilizes the idle memory of peer nodes. Our extensive performance study compares the benefits and limitations of the three cache modes, and shows that BalloonStasher can mitigate the memory underutilization problem and improve the performance of data-intensive applications by a large margin.
Daegyu Han, Jaeyoon Nam, Hokeun Cha, Changdae Kim 0001, Kwangwon Koh, Taehoon Kim 0001, Sang-Hoon Kim, Beomseok Nam
ACM Trans. Storage2