Mingzhe Zhang

Mingzhe Zhang

Auto-generated profile, based on publicly available information

Mingzhe Zhang

Institute of Information Engineering, CAS

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 June 2025
Verified
Conference Paper
Open access
DJDian Jiao
Dian Jiao
XDXianglong Deng
Xianglong Deng
ZWZhiwei Wang
Zhiwei Wang
SFShengyu Fan
Shengyu Fan
YCYi Chen
Yi Chen
MZMingzhe Zhang
Mingzhe Zhang

8 March 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MZMingzhe Zhang
Mingzhe Zhang
LZLunkai Zhang
Lunkai Zhang
LJLei Jiang
Lei Jiang
FCFred Chong
Fred Chong
ZLZhiyong Liu
Zhiyong Liu

23 June 2024
Verified
Conference Paper
Open access
JMJianan Mu
Jianan Mu
HHHusheng Han
Husheng Han
SSShangyi Shi
Shangyi Shi
JYJing Ye
Jing Ye
ZLZizhen Liu
Zizhen Liu
XLXiaowei Li
Xiaowei Li
The use of cross-scheme fully homomorphic encryption (FHE) in privacy-preserving applications present to be a new challenge to hardware accelerator design. Existing accelerator architectures with customized polynomial-level operator abstraction fail to efficiently handle hybrid FHE schemes due to the mismatch between computational demands and available hardware resources under various parameter settings. In this work, we propose a new accelerator architecture that consists of a novel finer-grained low-level operator, i.e., Meta-OP, that not only mathematically supports a diverse range of polynomial operations, but is also hardware-friendly for accelerator design without complex topological logic. We then design a new slot-based data management scheme to efficiently handle the distinct memory access patterns over the Meta-OP. With a slot-based data management approach, Alchemist can accelerate both arithmetic and logic FHE workloads with high hardware utilization rates. In the experiment, we show that Alchemist is up to 24,829X faster than CPU. For arithmetic FHE, compared with the SOTA ASIC accelerators, Alchemist achieves a 29.4X performance per area improvement on average. For logic FHE, compared with the SOTA ASIC accelerators, Alchemist achieves a 7.0X overall speed up on average.

20 June 2025
Verified
Conference Paper
Open access
SFShengyu Fan
Shengyu Fan
XDXianglong Deng
Xianglong Deng
LKLiang Kong
Liang Kong
GSGuiming Shi
Guiming Shi
GFGuang Fan
Guang Fan
MZMingzhe Zhang
Mingzhe Zhang

6 May 2025 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
CXChenjia Xie
Chenjia Xie
ZSZhuang Shao
Zhuang Shao
MZMingzhe Zhang
Mingzhe Zhang
YDYuan Du
Yuan Du
LDLi Du
Li Du
The emerging computing-in-memory (CIM) architecture shows promise in efficiently processing deep neural networks (DNNs) by minimizing the data movement through analog in-memory computing. Unfortunately, the energy efficiency of CIM is still limited since it struggles to efficiently process the massive nonlinear activation functions (AFs) widely used in DNNs. In the current solutions, AFs require to be fulfilled in the digital domain with co-processors or lookup table (LUT). Therefore, a significant amount of data requires a round-trip conversion between the analog and digital domains at each AF process. The unavoidable analog-to-digital and digital-to-analog (AD/DA) conversions dominate the system’s power consumption and reduce the overall energy efficiency. To address these issues, we propose a reconfigurable analog circuitry for nonlinear AF computation, named RAC-NAF. It is a pure analog circuitry that utilizes Taylor approximation (TA) to fit the arbitrary AFs, thereby reducing AD/DA conversions. To enhance the accuracy, RAC-NAF adopts a segmentation calculation method (SCM) based on the characteristics of nonlinear AFs. Moreover, the RAC-NAF provides the capability for reconfiguration to support various AFs and can be easily integrated with the existing CIM accelerators. The experimental results show that the proposed RAC-NAF significantly improves the performance of the CIM accelerators and reduces the energy consumption. When performing inference on various CIM accelerators, the energy consumption of AD/DA conversions can be reduced up to $12.31{\times }$ , while the overall energy efficiency can be increased by $2.34{\times }$ – $5.20{\times }$ , and the accuracy loss is below 1%.

3 November 2025 in ACM Transactions on Storage
Verified
Journal Article
Open access
YZYucheng Zhang
Yucheng Zhang
WZWenbin Zeng
Wenbin Zeng
HJHong Jiang
Hong Jiang
DFDan Feng
Dan Feng
ZXZichen Xu
Zichen Xu
DWDan Wu
Dan Wu
Delta compression can complement data deduplication by further minimizing redundancy through the compression of non-duplicate data chunks. When adding delta compression to deduplication-based backup systems, however, two primary challenges arise that degrade performance of inline deduplication. First, extra I/Os are introduced along the critical paths of backup and restoration for retrieving base chunks, slowing the system. Second, rewriting techniques prohibit specific data chunks from serving as base chunks for delta compression to improve restore performance, resulting in a loss of compression efficiency. In this paper, we introduce LoopDelta, a framework that seamlessly integrates delta compression into inline deduplication for backup storage, addressing the aforementioned challenges by using three techniques: (1) dual-locality-based similarity tracking leverages both logical and physical locality to detect most of the similar chunks, which, due to their locality, can be prefetched by piggybacking on routine operations during deduplication, thereby eliminating extra I/Os during backup; (2) cache-aware filter identifies base chunks requiring extra I/Os during restore and prevents their referencing, thus eliminating extra restore I/Os; and (3) inversed delta compression, which reverses the roles of base and target chunks in the traditional delta compression approach, thereby allowing for the delta compression of data chunks that are otherwise prohibited as base chunks due to rewriting techniques. Experiments show that LoopDelta increases the compression ratio by 1.28 to 11.33 times over basic deduplication, without significantly affecting backup throughput, and enhances restore performance by up to 3.57 times.