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

Puyun Hu

dblp:381/6121 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0001-2630-2918ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Memory systems · 56% Hardware accelerators and domain-specific architectures · 38% GPUs and heterogeneous computing · 6%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression
lookup-table-based inference
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Machine learning › Efficient and distributed learning
model compression
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Hardware accelerators and domain-specific architectures › machine learning accelerator › transformer accelerator
LLM inference accelerator
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Hardware accelerators and domain-specific architectures
machine learning accelerator
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Memory systems › processing-in-memory
near-bank processing-in-memory
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Memory systems
processing-in-memory
1.012026
MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware · IEEE Trans. Computers 2026
Memory systems
non-volatile memory
0.812024
Enabling Efficient NVM-Based Text Analytics without Decompression · ICDE 2024
Memory systems
DRAM
0.212024
Enabling Efficient NVM-Based Text Analytics without Decompression · ICDE 2024

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

quantization · 2.0model partitioning · 2.0lookup table · 2.0learning-based LUT construction · 2.0upper bound estimation · 1.5pruning · 1.5persistence strategy · 0.8persistence strategies · 0.8
YearPublicationVenuePosition
2026 MI-LLM: Multiplier-Free LLM Inference on Commodity Processing-in-Memory Hardware
abstract
Large language models (LLMs) are prominent for their superior ability in language understanding and generation. However, a notorious problem for LLM inference is low computational utilization caused by the memory bottleneck, since it typically requires large memory capacity and high bandwidth to process neural weights. By integrating processing cores into memory, Processing-In-Memory (PIM) architecture excels at alleviating memory bottleneck; with the recent release of the first commodity near-bank PIM hardware (NBP), PIM becomes off-the-shelf and shows great potential for accelerating LLM inference practically. However, simply shoehorning LLM inference on NBP can not achieve satisfactory performance due to its inherent limitations: weak compute performance, frequent cache misses caused by the limited working memory capacity, and poor inter-PIM-core communication bandwidth. To address these limitations, we propose MI-LLM, an efficient system deploying LLM inference on NBP hardware. Its key idea is to build NBP-aware Lookup Tables (LUTs) and completely replace multiplications with lookups on LUTs, thereby mitigating the limitation of weak compute performance. 1) To reduce the model accuracy drop caused by the use of LUT, MI-LLM tailors a learning-based LUT construction method to maintain the model accuracy. 2) To cope with frequent cache misses caused by LUT sizes far exceeding PIM working memory capacity, MI-LLM introduces the design of PIM-aware linear kernel, with the optimization of intra-row and inter-row reordering enabled, to enhance LUT lookup locality. 3) MI-LLM further proposes a model partitioning scheme to minimize inter-PIM-core communication. Kernel-level benchmarks reveal that MI-LLM achieves a 9% throughput improvement and an 11% increase in energy efficiency over GPU implementations. Compared to FP8 quantization, MI-LLM incurs only a 0.24 times increase in perplexity, demonstrating minimal accuracy degradation. Moreover, in our end-to-end evaluation, MI-LLM requires 80% fewer ALU operation ticks per output token than the GPU baseline.
Puyun Hu, Minhui Xie, Linjiang Li, Kuiyaohui Zhang, Erge Xiang, Jing Wang 0055, Size Zheng 0001, Xiao Zhang 0001, Yunpeng Chai
IEEE Trans. Computers1
2024 Enabling Efficient NVM-Based Text Analytics without Decompression
abstract
Text analytics directly on compression (TADOC) is a promising technology designed for handling big data analytics. However, a substantial amount of DRAM is required for high performance, which limits its usage in many important scenarios where the capacity of DRAM is limited, such as memory-constrained systems. Non-volatile memory (NVM) is a novel storage technology that combines the advantage of reading per-formance and byte addressability of DRAM with the durability of traditional storage devices like SSD and HDD. Unfortunately, no research demonstrates how to use NVM to reduce DRAM utilization in compressed data analytics. In this paper, we propose N-TADOC, which substitutes DRAM with NVM while maintaining TADOC's analytics performance and space savings. Utilizing an NVM block device to reduce DRAM utilization presents two challenges, including poor data locality in traversing datasets and auxiliary data structure reconstruction on NVM. We develop novel designs to solve these challenges, including a pruning method with NVM pool management, bottom-up upper bound estimation, correspondent data structures, and persistence strategy at different levels of cost. Experimental results show that on four real-world datasets, N-TADOC achieves 2.04× performance speedup compared to the processing directly on the uncompressed data and 70.7% DRAM space saving compared to the original TADOC.
Xiaokun Fang, Feng Zhang 0007, Junxiang Nong, Puyun Hu, Yunpeng Chai, Xiaoyong Du 0001
ICDE5