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.

Zhuomin He

dblp:372/7147 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0002-3477-0607ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
2 papers
Cloud and datacenter computing · 58% Distributed systems · 18% Memory systems · 18%
Artificial intelligence
1 paper
Efficient and distributed learning · 87% Language models and text generation · 13%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › inference serving
LLM serving
1.622025
Online Context Caching for Distributed Large Language Models Serving · INFOCOM 2025
Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttention · USENIX ATC 2024
Machine learning › Efficient and distributed learning › adaptive computation
layer skipping
0.912025
AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference · AAAI 2025
Machine learning › Efficient and distributed learning › inference efficiency
LLM inference optimization
0.912025
AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference · AAAI 2025
Memory systems
cache
0.912025
Online Context Caching for Distributed Large Language Models Serving · INFOCOM 2025
Cloud and datacenter computing
context caching
0.912025
Online Context Caching for Distributed Large Language Models Serving · INFOCOM 2025
Distributed systems › distributed machine learning
distributed inference
0.912025
Online Context Caching for Distributed Large Language Models Serving · INFOCOM 2025
Natural language and speech › Language models and text generation › large language model inference
long-context inference
0.312025
AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference · AAAI 2025
Cloud and datacenter computing
resource management
0.312025
Online Context Caching for Distributed Large Language Models Serving · INFOCOM 2025
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.212024
Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttention · USENIX ATC 2024

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

online caching · 0.9on-the-fly similarity · 0.9adaptive sublayer skipping · 0.9KV cache reuse · 0.8
YearPublicationVenuePosition
2025 AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference
abstract
Long-context large language models (LLMs) inference is increasingly critical, motivating a number of studies devoted to alleviating the substantial storage and computational costs in such scenarios. Layer-wise skipping methods are promising optimizations but rarely explored in long-context inference. We observe that existing layer-wise skipping strategies have several limitations when applied in long-context inference, including the inability to adapt to model and context variability, disregard for sublayer significance, and inapplicability for the prefilling phase. This paper proposes AdaSkip, an adaptive sublayer skipping method specifically designed for long-context inference. AdaSkip adaptively identifies less important layers by leveraging on-the-fly similarity information, enables sublayer-wise skipping, and accelerates both the prefilling and decoding phases. The effectiveness of AdaSkip is demonstrated through extensive experiments on various long-context benchmarks and models, showcasing its superior inference performance over existing baselines.
Zhuomin He, Yizhen Yao, Pengfei Zuo, Qinya Li, Zhenzhe Zheng 0001, Fan Wu 0006
AAAI1
2025 Online Context Caching for Distributed Large Language Models Serving
Bin Gao 0013, Zhuomin He, Yizhen Yao, Zhanzhi Lou Lou, Zhi Zhou 0006, Weng-Fai Wong
INFOCOM2
2024 IMI: In-memory Multi-job Inference Acceleration for Large Language Models
abstract
Large Language Models (LLMs) are increasingly used in various applications but are computationally complex and energy-consuming due to the high volume of off-chip memory accesses. Processing-in-Memory (PIM) has emerged as a potential solution for efficient inference. However, existing PIM accelerators designed for deep neural networks (DNNs) aren’t suitable for LLMs because of differences in operations, input sizes, and job completion times. This leads to performance issues like head-of-line blocking where an earlier job can monopolize resources at the expense of later jobs, and low resource utilization. To improve efficiency, a time-multiplex solution and job colocation accelerator could be beneficial. However, facilitating multi-job execution with in-memory acceleration is challenging due to limitations in memristor architecture, inefficiency of non-stationary weight programming, difficulty in dynamic partitioning of hardware resources, and complexity in dynamic job scheduling. This work proposes a PIM-based LLM accelerator to enable the concurrent LLM inference job execution. The experiment shows that IMI can significantly improve resource utilization as well as the rate of satisfying the service level requirements of jobs.
Bin Gao 0013, Zhehui Wang, Zhuomin He, Tao Luo 0014, Weng-Fai Wong, Zhi Zhou 0006
ICPP3
2024 Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttention
Zhuomin He, Puru Sharma, Qingxuan Kang, Djordje Jevdjic, Junbo Deng, Xingkun Yang, Pengfei Zuo
USENIX ATC2