Zihan Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zihan Liu has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
- Jingwen Leng
Shanghai Jiao Tong University, Shanghai, China
20 shared publications - Minyi Guo
Shanghai Jiao Tong University, Shanghai, China
18 shared publications - Yu Feng
Shanghai Jiao Tong University, Shanghai, China
10 shared publications - Quan Chen
Shanghai Jiao Tong University
7 shared publications - Yuhao Zhu
University of Rochester
7 shared publications - Cong Guo
Duke University, Durham, NC, USA
6 shared publications
Latest Publications
- Open Access
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 333-347
Erasynth: Improving Quantum Uncomputation with Structural Measurements
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 333-347
Open AccessErasynth: Improving Quantum Uncomputation with Structural Measurements
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1831-1846
STRIDE: Efficient Secure Transformer Inference via Inter-Operator Protocol and Operator Co-Design
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1831-1846
Open AccessSTRIDE: Efficient Secure Transformer Inference via Inter-Operator Protocol and Operator Co-Design
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1728-1740
AlphaCu: A Transformation-Driven Synthesis Framework for LLM-Based GPU Kernel Generation
Large language models show promise for code generation, yet their effectiveness in producing high-performance GPU kernels remains insufficiently understood. Recent agentic workflows improve over direct prompting through specialized generation roles and execution feedback, but our characterization of a representative workflow reveals failures in optimization-strategy selection, hardware-specific instruction realization, and shape-dependent parameter selection. We present AlphaCu, a transformation-driven synthesis framework for LLM-based GPU kernel generation. AlphaCu treats kernel generation as structured synthesis over explicit optimization decisions rather than end-to-end code emission. Specifically, AlphaCu represents these decisions as scoped transformation passes maintained across agent-coordinated synthesis stages, enabling compatibility checking and failure attribution. AlphaCu binds selected hardware-sensitive operations to pre-validated microkernels and uses target-device measurements to revise transformation choices and tune runtime configurations. We evaluate AlphaCu on 104 test cases covering single and fused operators across four GPU architectures: NVIDIA H100, A100, V100, and AMD MI210. Under comparable generation budgets, AlphaCu achieves 100% functional correctness on our benchmark suite and delivers an average speedup of 5.64× over prior LLM workflows, while remaining competitive with vendor libraries and tensor compilers.
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1728-1740
Open AccessAlphaCu: A Transformation-Driven Synthesis Framework for LLM-Based GPU Kernel Generation
Large language models show promise for code generation, yet their effectiveness in producing high-performance GPU kernels remains insufficiently understood. Recent agentic workflows improve over direct prompting through specialized generation roles and execution feedback, but our characterization of a representative workflow reveals failures in optimization-strategy selection, hardware-specific instruction realization, and shape-dependent parameter selection. We present AlphaCu, a transformation-driven synthesis framework for LLM-based GPU kernel generation. AlphaCu treats kernel generation as structured synthesis over explicit optimization decisions rather than end-to-end code emission. Specifically, AlphaCu represents these decisions as scoped transformation passes maintained across agent-coordinated synthesis stages, enabling compatibility checking and failure attribution. AlphaCu binds selected hardware-sensitive operations to pre-validated microkernels and uses target-device measurements to revise transformation choices and tune runtime configurations. We evaluate AlphaCu on 104 test cases covering single and fused operators across four GPU architectures: NVIDIA H100, A100, V100, and AMD MI210. Under comparable generation budgets, AlphaCu achieves 100% functional correctness on our benchmark suite and delivers an average speedup of 5.64× over prior LLM workflows, while remaining competitive with vendor libraries and tensor compilers.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
eLLM: Elastic Memory Management Framework for Efficient LLM Serving
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccesseLLM: Elastic Memory Management Framework for Efficient LLM Serving
- Open Access
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-25
JUNO++: Optimizing ANNS and Enabling Efficient Sparse Attention in LLM via Ray Tracing Core
Approximate Nearest Neighbor Search (ANNS) is a fundamental technique in modern intelligent applications, including recommendation systems and vector databases. With the advent of large language models (LLMs), ANNS plays a critical role in enabling attention pruning mechanism that exploit the sparsity of attention, such as top-K attention and retrieval attention. As a result, the efficiency of ANNS has become increasingly crucial. In this article, we identify a key inefficiency in state-of-the art ANNS methods based on product quantization: the redundant computation and accumulation of pairwise distance with codebook. To address this, we propose JUNO++ , the system consists of (i) an end-to-end ANNS search pipeline based on ray-tracing core leveraging sparsity-aware algorithm and ii) an integration of the ray-tracing based ANNS search pipeline to the attention computation. For ANNS search pipeline, evaluation on four datasets indicate 2.2x to 8.5x search throughput improvement. For ANNS-powered sparse attention, JUNO++ achieves a 46% reduction in latency of \(q\times k^\top\) calculation comparing to the baseline with almost identical accuracy, which is not only a key component of retrieval-based sparse attention, but also the dominant component in long-context scenario, implying a considerable end-to-end improvement.- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-25
Open AccessJUNO++: Optimizing ANNS and Enabling Efficient Sparse Attention in LLM via Ray Tracing Core
Approximate Nearest Neighbor Search (ANNS) is a fundamental technique in modern intelligent applications, including recommendation systems and vector databases. With the advent of large language models (LLMs), ANNS plays a critical role in enabling attention pruning mechanism that exploit the sparsity of attention, such as top-K attention and retrieval attention. As a result, the efficiency of ANNS has become increasingly crucial. In this article, we identify a key inefficiency in state-of-the art ANNS methods based on product quantization: the redundant computation and accumulation of pairwise distance with codebook. To address this, we propose JUNO++ , the system consists of (i) an end-to-end ANNS search pipeline based on ray-tracing core leveraging sparsity-aware algorithm and ii) an integration of the ray-tracing based ANNS search pipeline to the attention computation. For ANNS search pipeline, evaluation on four datasets indicate 2.2x to 8.5x search throughput improvement. For ANNS-powered sparse attention, JUNO++ achieves a 46% reduction in latency of \(q\times k^\top\) calculation comparing to the baseline with almost identical accuracy, which is not only a key component of retrieval-based sparse attention, but also the dominant component in long-context scenario, implying a considerable end-to-end improvement. - Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 167-184
A Sample-Free Compilation Framework for Efficient Dynamic Tensor Computation
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 167-184
Open AccessA Sample-Free Compilation Framework for Efficient Dynamic Tensor Computation
- Open Access
- 6 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 247-263
Voyager: Input-Adaptive Algebraic Transformations for High-Performance Graph Neural Networks
- 6 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 247-263
Open AccessVoyager: Input-Adaptive Algebraic Transformations for High-Performance Graph Neural Networks
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1925-1939
Lumina: Real-Time Neural Rendering by Exploiting Computational Redundancy
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1925-1939
Open AccessLumina: Real-Time Neural Rendering by Exploiting Computational Redundancy
- Open Access
Lumina: Real-Time Mobile Neural Rendering by Exploiting Computational Redundancy
3D Gaussian Splatting (3DGS) has vastly advanced the pace of neural rendering, but it remains computationally demanding on today's mobile SoCs. To address this challenge, we propose Lumina, a hardware-algorithm co-designed system, which integrates two principal optimizations: a novel algorithm, S^2, and a radiance caching mechanism, RC, to improve the efficiency of neural rendering. S2 algorithm exploits temporal coherence in rendering to reduce the computational overhead, while RC leverages the color integration process of 3DGS to decrease the frequency of intensive rasterization computations. Coupled with these techniques, we propose an accelerator architecture, LuminCore, to further accelerate cache lookup and address the fundamental inefficiencies in Rasterization. We show that Lumina achieves 4.5x speedup and 5.3x energy reduction against a mobile Volta GPU, with a marginal quality loss (< 0.2 dB peak signal-to-noise ratio reduction) across synthetic and real-world datasets.
Open AccessLumina: Real-Time Mobile Neural Rendering by Exploiting Computational Redundancy
3D Gaussian Splatting (3DGS) has vastly advanced the pace of neural rendering, but it remains computationally demanding on today's mobile SoCs. To address this challenge, we propose Lumina, a hardware-algorithm co-designed system, which integrates two principal optimizations: a novel algorithm, S^2, and a radiance caching mechanism, RC, to improve the efficiency of neural rendering. S2 algorithm exploits temporal coherence in rendering to reduce the computational overhead, while RC leverages the color integration process of 3DGS to decrease the frequency of intensive rasterization computations. Coupled with these techniques, we propose an accelerator architecture, LuminCore, to further accelerate cache lookup and address the fundamental inefficiencies in Rasterization. We show that Lumina achieves 4.5x speedup and 5.3x energy reduction against a mobile Volta GPU, with a marginal quality loss (< 0.2 dB peak signal-to-noise ratio reduction) across synthetic and real-world datasets.
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1189-1202
StreamGrid: Streaming Point Cloud Analytics via Compulsory Splitting and Deterministic Termination
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1189-1202
Open AccessStreamGrid: Streaming Point Cloud Analytics via Compulsory Splitting and Deterministic Termination