Demo Data from EDBT 2026 / reviewers in the wild / expert
Dejun Luo
dblp:244/9802
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0007-7581-9976ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 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 · 45% High-performance computing · 34% GPUs and heterogeneous computing · 21% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
data compression |
1.0 | 1 | 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level Interpolation · PPoPP 2026 |
High-performance computing › lossy compression
error-bounded lossy compression |
1.0 | 1 | 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level Interpolation · PPoPP 2026 |
GPUs and heterogeneous computing › GPU computing › GPU algorithms
GPU compression |
0.3 | 1 | 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level Interpolation · PPoPP 2026 |
GPUs and heterogeneous computing
GPU computing |
0.3 | 1 | 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level Interpolation · PPoPP 2026 |
Storage systems › data management
scientific data storage |
0.3 | 1 | 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level Interpolation · PPoPP 2026 |
Methods — techniques the papers use, named apart from their topics
zero-aware parallel algorithms · 1.0sign-absolute coding · 1.0multi-level interpolation · 1.0bitplane extraction · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PRISM: An Efficient GPU-Based Lossy Compression Framework for Progressive Data Retrieval with Multi-Level InterpolationabstractWith the exponential growth of computing power, large-scale scientific simulations are producing massive volumes of data, leading to critical storage and I/O challenges. Error-bounded lossy compression has become one of the most effective solutions for reducing data size while preserving accuracy. Meanwhile, to achieve high-performance compression on such large datasets, leveraging GPUs has become increasingly essential. GPU-based lossy compressors deliver strong performance, but typically support only single-precision decompression, limiting their ability to meet the diverse accuracy requirements of scientific workflows. Progressive compressors can address this limitation by enabling on-demand precision retrieval. However, existing progressive lossy compressors on GPU still suffer from low throughput. To overcome these challenges, we present PRISM, a GPU-based progressive lossy compressor that achieves both high throughput and multi-precision retrieval, which introduces a high performance progressive framework that integrates the multiple interpolation predictors, efficient bitplane extraction, and an enhanced lossless compression that combines sign-absolute coding with zero-aware parallel algorithms. Evaluations on representative real-world datasets from five scientific domains show that PRISM significantly outperforms state-of-the-art progressive compressors on GPU, reducing retrieval data volume by over 15.6× and achieving up to 20.1× higher throughput on the NVIDIA H100 GPU under the same error bounds. Bing Lu 0001, Hairui Zhao 0002, Dejun Luo, Wenjing Huang 0002, Yida Gu, Jinyang Liu 0003, Guangming Tan, Dingwen Tao |
PPoPP | 4 |
| 2026 | KVServe: Service-Aware KV Cache Compression for Communication-Efficient Disaggregated LLM Serving
Xinyang Ma, Dejun Luo, Hairui Zhao 0002, Bing Lu 0001, Wenjing Huang 0002, Yida Gu, Jinyang Liu 0003, Dingwen Tao, Guangming Tan |
SIGCOMM | 3 |