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

Kefan Liu

dblp:258/4403 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0004-9549-6607ORCID · 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
Memory systems · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
remote memory
1.012026
RaidenSwap: A Multi-Swap Remote System for Multi-core Applications · EuroSys 2026
Operating systems › resource management › memory management
page swapping
0.312026
RaidenSwap: A Multi-Swap Remote System for Multi-core Applications · EuroSys 2026
Operating systems › resource management › memory management
virtual memory
0.312026
RaidenSwap: A Multi-Swap Remote System for Multi-core Applications · EuroSys 2026

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

swap task offloading · 2.0lock contention reduction · 2.0
YearPublicationVenuePosition
2026 RaidenSwap: A Multi-Swap Remote System for Multi-core Applications
abstract
Kernel-based remote memory systems are gaining traction in datacenters due to their significant improvement in memory utilization and their ability to transparently provide applications with unlimited memory capacity. However, the high degree of parallelism in contemporary applications leads to a significant demand for remote access throughput, which mismatches with the state-of-the-art kernel swap path due to its inherently limited parallelism. As a result, it cannot scale up the multi-core applications. We dive into the implementation of the swap path and identify the root cause behind it - significant lock contentions and inefficient swap tasks offloading.
Kefan Liu, Ke Liu 0004, Xu Zhang 0033, Ning Liu 0031, Sa Wang, Yungang Bao, Mingyu Chen 0001, Chenxi Wang 0005
EuroSys1