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

Chenqi Zhang 0002

dblp:297/3419-2 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0003-2730-8494ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 3 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
2 papers
Memory systems · 56% Hardware accelerators and domain-specific architectures · 36% Cloud and datacenter computing · 8%
Artificial intelligence
1 paper
Efficient and distributed learning · 61% Representation and self-supervised learning · 30% Language models and text generation · 9%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
inference efficiency
0.912025
ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression · DAC 2025
Machine learning › Efficient and distributed learning › KV cache management
KV cache compression
0.912025
ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression · DAC 2025
Machine learning › Representation and self-supervised learning
semantic clustering
0.912025
ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression · DAC 2025
Query processing and optimization
OLAP
0.912025
DHAP: Towards Efficient OLAP in a Disaggregated and Heterogeneous Environment · SC 2025
Memory systems
memory optimization
0.912025
STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support · DAC 2025
Hardware accelerators and domain-specific architectures
neural rendering accelerator
0.912025
STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support · DAC 2025
Natural language and speech › Language models and text generation › large language model inference
long-context inference
0.312025
ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression · DAC 2025
Rendering › gaussian splatting
3d gaussian splatting
0.312025
STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support · DAC 2025
Hardware accelerators and domain-specific architectures › accelerator integration
heterogeneous accelerator integration
0.312025
DHAP: Towards Efficient OLAP in a Disaggregated and Heterogeneous Environment · SC 2025
Cloud and datacenter computing
resource disaggregation
0.312025
DHAP: Towards Efficient OLAP in a Disaggregated and Heterogeneous Environment · SC 2025

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

streaming pipeline · 1.7algorithm-architecture co-design · 1.7indexing · 0.9clustering · 0.9
YearPublicationVenuePosition
2025 ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression
abstract
Large Language Models (LLMs) have been widely deployed in a variety of applications, and the context length is rapidly increasing to handle tasks such as long-document QA and complex logical reasoning. However, long context poses significant challenges for inference efficiency, including high memory costs of key-value (KV) cache and increased latency due to extensive memory accesses. Recent works have proposed compressing KV cache to approximate computation, but these methods either evict tokens permanently, never recalling them for later inference, or recall previous tokens at the granularity of pages divided by textual positions. Both approaches degrade the model accuracy and output quality. To achieve efficient and accurate recallable KV cache compression, we introduce ClusterKV, which recalls tokens at the granularity of semantic clusters. We design and implement efficient algorithms and systems for clustering, selection, indexing and caching. Experiment results show that ClusterKV attains negligible accuracy loss across various tasks with 32 k context lengths, using only a 1 k to 2 k KV cache budget, and achieves up to a $2 \times$ speedup in latency and a $2.5 \times$ improvement in decoding throughput. Compared to SoTA recallable KV compression methods, ClusterKV demonstrates higher model accuracy and output quality, while maintaining or exceeding inference efficiency. Our code is available at https://github.com/sjtu-zhao-lab/ClusterKV.
Guangda Liu, Chengwei Li, Jieru Zhao, Chenqi Zhang 0002, Minyi Guo
DAC4
2025 STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support
abstract
3D Gaussian Splatting (3DGS) has gained popularity for its efficiency and sparse Gaussian-based representation. However, 3DGS struggles to meet the real-time requirement of 90 frames per second (FPS) on resource-constrained mobile devices, achieving only 2 to 9 FPS. Existing accelerators focus on compute efficiency but overlook memory efficiency, leading to redundant DRAM traffic. We introduce STREAMINGGS, a fully streaming 3DGS algorithm-architecture co-design that achieves fine-grained pipelining and reduces DRAM traffic by transforming from a tile-centric rendering to a memory-centric rendering. Results show that our design achieves up to 45.7 × speedup and 62.9 × energy savings over mobile Ampere GPUs.
Chenqi Zhang 0002, Yu Feng 0007, Jieru Zhao, Guangda Liu, Wenchao Ding 0001, Chentao Wu, Minyi Guo
DAC1
2025 DHAP: Towards Efficient OLAP in a Disaggregated and Heterogeneous Environment
abstract
Disaggregation of hardware resources and integration of heterogeneous accelerators are two emerging trends in datacenters. Existing data systems focus on either disaggregated systems with homogeneous CPU processors or incorporation of heterogeneous accelerators within traditional monolithic servers. None can adequately address the challenges posed by systems that are both disaggregated and heterogeneous.
Guangda Liu, Chenqi Zhang 0002, Yizhou Shan, Zeke Wang, Shixuan Sun, Minyi Guo, Jieru Zhao
SC2