EDBT 2026 Demo / reviewers in the wild / expert
Quanyi Zhang
dblp:411/0634
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0005-7405-3302ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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 · 60% Hardware accelerators and domain-specific architectures · 40% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures › domain-specific accelerator › data processing accelerator
data processing unit |
0.9 | 1 | 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores · Proc. ACM Manag. Data 2025 |
Hardware accelerators and domain-specific architectures › accelerator offloading
DPU offloading |
0.9 | 1 | 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores · Proc. ACM Manag. Data 2025 |
Storage systems
key-value storage |
0.9 | 1 | 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores · Proc. ACM Manag. Data 2025 |
Storage systems › key-value storage
LSM-tree key-value store |
0.9 | 1 | 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores · Proc. ACM Manag. Data 2025 |
Storage systems
storage reliability |
0.9 | 1 | 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores · Proc. ACM Manag. Data 2025 |
Methods — techniques the papers use, named apart from their topics
pipeline parallelism · 0.9adaptive scheduling · 0.9DPU offloading · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value StoresabstractRapid increase of storage and network bandwidth incurs higher CPU consumption in modern data systems. This phenomenon is particularly evident for log-structured merged key-value stores (LSM-KVS), which rely on resource-intensive background operations to flush and compact disk data. While extensive research has been conducted to reduce the CPU overhead of background compaction, less attention has been paid to background flushing, which can also consume a significant amount of valuable CPU cycles and disrupt CPU caches, ultimately impacting overall performance. In this paper, we propose DFlush, a novel solution that uses DPUs to offload background flush operations to reduce its CPU cost. DPUs are an appealing choice for this goal due to their cost-effectiveness, ease of programming, and widespread deployment. However, their complex hardware architecture requires careful design of both the data and control planes. To fully harness the DPU's capabilities, DFlush decomposes a flush job into fine-grained steps, mapped them to DPU hardware units, and accelerates them through pipeline, data, and channel parallelism, ensuring data-plane efficiency. It also introduces an adaptive control plane that dynamically schedules flush jobs from different LSM-KVS instances based on their priority, reducing write stall and tail latency. Our experiments on a real DPU platform with an industrial-grade LSM-KVS show that DFlush delivers higher throughput, significantly lower tail latency, and saves up to dozens of CPU cores per LSM-KVS server while reducing energy consumption. Chen Ding 0012, Kai Lu 0002, Quanyi Zhang, Zekun Ye, Ting Yao 0001, Daohui Wang, Huatao Wu, Jiguang Wan 0001 |
Proc. ACM Manag. Data | 3 |