Feng Yu

Feng Yu

Auto-generated profile, based on publicly available information

Feng Yu

State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2024
Verified
Conference Paper
Open access
FYFeng Yu
Feng Yu
GLGuangli Li
Guangli Li
JZJiacheng Zhao
Jiacheng Zhao
HCHuimin Cui
Huimin Cui
XFXiaobing Feng
Xiaobing Feng
JXJingling Xue
Jingling Xue
In recent times, dynamic-shape neural networks have gained widespread usage in intelligent applications to address complex tasks, introducing challenges in optimizing tensor programs due to their dynamic nature. As the operators' shapes are determined at runtime in dynamic scenarios, the compilation process becomes expensive, limiting the practicality of existing static-shape tensor compilers. To address the need for effective and efficient optimization of dynamic-shape neural networks, this paper introduces MikPoly, a novel dynamic-shape tensor compiler based on micro-kernel polymerization. MikPoly employs a two-stage optimization approach, dynamically combining multiple statically generated micro-kernels using a lightweight cost model based on the shape of a tensor operator known at runtime. We evaluate the effectiveness of MikPoly by employing popular dynamic-shape operators and neural networks on two representative accelerators, namely GPU Tensor Cores and Ascend NPUs. Our experimental results demonstrate that MikPoly effectively optimizes dynamic-shape workloads, yielding an average performance improvement of 1.49× over state-of-the-art vendor libraries.

1 December 2023 in BenchCouncil Transactions on Benchmarks, Standards and Evaluations
Verified
Journal Article
Open access
FYFeng Yu
Feng Yu
HZHao Zhang
Hao Zhang
ACAo Chen
Ao Chen
XWXueying Wang
Xueying Wang
XLXiaoxia Liang
Xiaoxia Liang
XFXiaobing Feng
Xiaobing Feng

26 June 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
YZYangyu Zhang
Yangyu Zhang
GLGuangli Li
Guangli Li
FYFeng Yu
Feng Yu
FLFan Luo
Fan Luo
QSQianqi Sun
Qianqi Sun
JXJingling Xue
Jingling Xue
The prevalence of dynamic tensor shapes, driven by applications like language model serving with varying sequence lengths, is a defining characteristic of modern deep neural networks. This dynamism poses a fundamental challenge: reconciling the need for intensive, offline code generation to achieve peak performance with the demand for low-latency, adaptive execution to handle unpredictable runtime tensor shapes. Consequently, mainstream strategies are ineffective. Vendor-provided libraries, while highly optimized for a subset of common shapes, suffer performance degradation on unconventional ones. Static tensor compilers are hamstrung by prohibitive just-in-time compilation overheads for each new shape. While recent dynamic-shape compilers offer an alternative, they rely on predefined shape ranges, making them brittle when inputs fall outside these bounds. To resolve this tension, we present MoonPoly , a dynamic-shape tensor compiler that introduces micro-kernel polymerization . Our approach decouples these conflicting requirements through a two-stage process. In the offline stage, it performs intensive auto-tuning to generate a set of micro-kernels and corresponding performance models. The online stage then performs adaptive execution, rapidly assembling a near-optimal tensor operator on-the-fly, guided by a lightweight cost model. Evaluated on an NVIDIA A100 GPU, MoonPoly achieves an average operator-level speedup of 1.27× over the cuBLAS library across a diverse set of operators and data types, which in turn yields end-to-end inference acceleration for a variety of models, including BERT, the Vision Transformer, and large language models.