Kaiyuan Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kaiyuan Xu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Shu Yin
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
2 shared publications - Jiufei Liu
School of Information Science and Technology, ShanghaiTech University, Shanghai, Shanghai, China
1 shared publication - Tianyuan Wu
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
1 shared publication - Yiwei Yang
UC Santa Cruz, Santa Cruz, California, USA
1 shared publication - Yixuan Meng
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
1 shared publication - Yuchen Liu
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 414-424
CmptQuiet: Optimizing Tail Latency and Throughput in LSM-Tree Key-Value Stores via Contention-Aware Compaction
Log-Structured Merge-Tree (LSM-tree) based Key-Value stores are foundational to data center storage but suffer from high tail latency due to a fundamental read-write trade-off and disruptive compaction. This paper introduces CmptQuiet, a system that breaks this trade-off to deliver low tail latency without sacrificing throughput. CmptQuiet employs an auxiliary index table and an adaptive resource allocator to mitigate compaction’s impact. Micro-benchmark results across various Read:Write ratios and access distributions show that CmptQuiet reduces P99 tail latency by up to 91.5% compared to auto-tuned RocksDB, while further improving the system throughput. In macro-benchmarks using real-world YCSB workloads, CmptQuiet outperforms state-of-the-art systems including SILK, CruiseDB, and ADOC. It achieves up to 40.9% lower P99 tail latency than CruiseDB. Moreover, CmptQuiet maintains a stable throughput advantage over all three baselines, with a maximum average improvement reaching up to 22.3%.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 414-424
Open AccessCmptQuiet: Optimizing Tail Latency and Throughput in LSM-Tree Key-Value Stores via Contention-Aware Compaction
Log-Structured Merge-Tree (LSM-tree) based Key-Value stores are foundational to data center storage but suffer from high tail latency due to a fundamental read-write trade-off and disruptive compaction. This paper introduces CmptQuiet, a system that breaks this trade-off to deliver low tail latency without sacrificing throughput. CmptQuiet employs an auxiliary index table and an adaptive resource allocator to mitigate compaction’s impact. Micro-benchmark results across various Read:Write ratios and access distributions show that CmptQuiet reduces P99 tail latency by up to 91.5% compared to auto-tuned RocksDB, while further improving the system throughput. In macro-benchmarks using real-world YCSB workloads, CmptQuiet outperforms state-of-the-art systems including SILK, CruiseDB, and ADOC. It achieves up to 40.9% lower P99 tail latency than CruiseDB. Moreover, CmptQuiet maintains a stable throughput advantage over all three baselines, with a maximum average improvement reaching up to 22.3%.
- 11 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (9) , 2047-2049
Reproducibility: Performance Evaluation of MemXCT on Azure CycleCloud Platform
Memory-Centric X-ray Computational Tomography(CT) is an iterative reconstruction technique that trades compute simplifications with higher memory accesses. MemXCT implements a sparse matrix-vector multiplication(SpMV) with multi-stage buffering and two-level pseudo-Hilbert ordering for optimization. Motivated by the need to validate conclusions from previous work, we reproduce the numerical results, the algorithm’s performance, and the scaling behavior of the algorithms as the number of MPI processes increases on Azure. Digital artifacts from these experiments are available at: 10.5281/zenodo.5598108
- 11 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (9) , 2047-2049
Reproducibility: Performance Evaluation of MemXCT on Azure CycleCloud Platform
Memory-Centric X-ray Computational Tomography(CT) is an iterative reconstruction technique that trades compute simplifications with higher memory accesses. MemXCT implements a sparse matrix-vector multiplication(SpMV) with multi-stage buffering and two-level pseudo-Hilbert ordering for optimization. Motivated by the need to validate conclusions from previous work, we reproduce the numerical results, the algorithm’s performance, and the scaling behavior of the algorithms as the number of MPI processes increases on Azure. Digital artifacts from these experiments are available at: 10.5281/zenodo.5598108