EDBT 2026 Demo / reviewers in the wild / expert
Silwan Chang
dblp:424/4255
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
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 |
Storage systems · 64% Distributed systems · 36% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › distributed storage
disaggregated storage |
1.0 | 1 | 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage System · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems
distributed storage |
1.0 | 1 | 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage System · IEEE Trans. Parallel Distributed Syst. 2026 |
Distributed systems › fault tolerance
failure recovery |
1.0 | 1 | 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage System · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems
data placement |
0.3 | 1 | 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage System · IEEE Trans. Parallel Distributed Syst. 2026 |
Distributed systems
fault tolerance |
0.3 | 1 | 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage System · IEEE Trans. Parallel Distributed Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
relocation · 1.0CRUSH-based data placement · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | NVMe-oF-R: Fast Recovery Design on Disaggregated Distributed Storage SystemabstractFailures in a large distributed storage system are often critical, leading to unexpected I/Os that are required to restore the system's health and ensure availability. With the advent of NVMe-oF, the disaggregation of compute and storage resources presents an opportunity to minimize the negative impact of the compute failure by reattaching the storage resources. However, despite advances in hardware, modern distributed storage systems have not yet fully adapted to the disaggregated architecture. There are four main reasons: (1) lack of awareness of recoverable failure events in the disaggregated architecture, (2) incorrect availability management with respect to the NVMe-oF fault domains, (3) unnecessary data rebalance I/Os for uniform distribution triggered even after the failure is recovered, (4) load imbalance caused by asymmetric deployment of compute resources after blind relocation for recovery. To address these challenges, we introduceNVMe-oF-R, a resilient disaggregated distributed storage architecture for fast recovery.NVMe-oF-Rcomprises three techniques: (1)NVMe-oF adapter, which detects recoverable failure events and orchestrates relocation; (2)DCRUSH, a data placement strategy that considers the NVMe-oF based disaggregation architecture; and (3)Relocater, which efficiently relocates failed compute resources and fixes stragglers that arise after recovery. We implementNVMe-oF-Ratop the storage orchestration layer in a CRUSH-based distributed storage system, Ceph. Our experimental results demonstrate thatNVMe-oF-Rcan eliminate unnecessary recovery traffic and reduce recovery time by more than 50%. Myoungwon Oh, Cheolho Kang, Woojoong Kim, Yangwoo Roh, Jeong-Uk Kang, Silwan Chang |
IEEE Trans. Parallel Distributed Syst. | 7 |