Qianming Yang

Qianming Yang

Auto-generated profile, based on publicly available information

Qianming Yang

College of Computer Science and Technology, National University of Defense Technology

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
18 September 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HTHongbing Tan
Hongbing Tan
LHLibo Huang
Libo Huang
ZZZhong Zheng
Zhong Zheng
HGHui Guo
Hui Guo
QYQianmin Yang
Qianmin Yang
NXNong Xiao
Nong Xiao
The dot-product $\sum _{i=1}^{N} A_{i}\times B_{i}$ is one of the most frequently used operations for a wide variety of high-performance computing (HPC) and artificial intelligence (AI) applications. However, for large-scale algorithms, such as acrshort GEMM and acrshort FFT, independent additions are necessary to accumulate the results of length-limited dot-product in order to form the final result, thus increasing latency and overhead. Hence, we proposed a dot-product-dual-accumulate (DPDAC) architecture capable of performing $\left({\sum _{i=1}^{N=1,2,4} A_{i}\times B_{i} + \sum _{j=1}^{M=1,2} C_{j}}\right)$ on a wide range of formats. The proposed architecture supports both single-path and dual-path execution. The single path is designed for performing acrshort DP acrshort FMA or DPDAC of lower formats, while dual-path supports parallel operations for single-precision (SP) addition and 2-term SP or acrshort TF32 dot-product or 4-term acrshort HP or BF16 dot-product. Moreover, numerical precision conversion is also supported by the proposed architecture, allowing for the conversion of numbers to higher or lower formats. The proposed DPDAC has been demonstrated to significantly reduce the overhead in comparison to discrete designs that utilize multiple single-mode acrshort FP units to achieve the same functionalities. Furthermore, when compared to the state-of-the-art multiple-precision designs, the proposed architecture has been shown to support a wide range of formats and a greater variety of operations with lower costs.

30 January 2020 in IEEE Access
Verified
Journal Article
Open access
ZCZhuang Cao
Zhuang Cao
HSHuayou Su
Huayou Su
QYQianming Yang
Qianming Yang
JSJunzhong Shen
Junzhong Shen
MWMei Wen
Mei Wen
CZChunyuan Zhang
Chunyuan Zhang
This paper presents a framework for converting P4 programs to VHDL and then implementing them on Field-Programmable Gate Array (FPGA) platforms. In this framework, a match-action-based hardware architecture is introduced with clearly designed components, which correspond to the described functionalities in the P4 programs. A pre-built template library is used for the compilation that includes optimized VHDL templates corresponding to specific clearly designed components. From the output of a standard frontend P4 compiler, the proposed compiler extracts parameters and relationships within the functions being employed, maps them to corresponding templates by calling, configuring, optimizing and instantiating them, and finally generates the appropriate FPGA code. A pre-built evaluation library is also proposed that helps the compiler to optimize the implementation during the mapping phase. A prototype of this framework is also implemented and evaluated; in this process, it is found that the generated processors use few resources and have high throughput and low latency. Compared with a state-of-the-art solution, the packet processing time is halved. In addition, the generated processors are able to operate at a line rate of nearly 100 Gigabits per second for a basic layer-3 forwarding application.

5 June 2023
Verified
Conference Paper
Open access
JZJing Zhang
Jing Zhang
LHLibo Huang
Libo Huang
HTHongbing Tan
Hongbing Tan
LYLing Yang
Ling Yang
ZZZhong Zheng
Zhong Zheng
QYQianming Yang
Qianming Yang

30 June 2025 in Electronics
Verified
Journal Article
Open access
PDF file
WFWenwen Fu
Wenwen Fu
JYJinli Yan
Jinli Yan
JZJian Zhang
Jian Zhang
SYSun Yinhan
Sun Yinhan
YWYong Wang
Yong Wang
YWYongwen Wang
Yongwen Wang
Integrated security stacks, which offer diverse security function chains in a single device, hold substantial potential to satisfy the security requirements of multiple tenants on a public cloud. However, it is difficult for the software-only or hardware-customized security stack to establish a good tradeoff between performance and flexibility. SmartNIC overcomes these limitations by providing a programmable platform for implementing these functions with hardware acceleration. Significantly, without a professional CPU/SmartNIC co-design, developing security function chains from scratch with low-level APIs is challenging and tedious for network operators. This paper presents PASS, a flexible programmable framework for the fast development of high-performance security stacks with SmartNIC acceleration. In the data plane, PASS provides modular abstractions to extract the shared security logic and eliminate redundant operations by reusing the intermediate results with the customized metadata. In the control plane, PASS offloads the tedious security policy conversion to the proposed security auxiliary plane. With well-defined APIs, developers only need to focus on the core logic instead of labor-intensive shared logic. We built a PASS prototype based on a CPU-FPGA platform and developed three typical security components. Compared to implementation from scratch, PASS reduces the code by 65% on average. Additionally, PASS improves security processing performance by 76% compared to software-only implementations and optimizes the latency of policy translation and distribution by 90% versus the architecture without offloading.

11 December 2012 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
QYQianming Yang
Qianming Yang
MWMei Wen
Mei Wen
NWNan Wu
Nan Wu
CZChunyuan Zhang
Chunyuan Zhang