A Fast-Convergence Near-Memory-Computing Accelerator for Solving Partial Differential Equations

Solving partial differential equations (PDEs) is omnipresent in scientific research and engineering and requires expensive numerical iteration for memory and computation. The primary concerns for solving PDEs are convergence speed, data movement, and power consumption. This work proposed the first fast-convergence PDE solver with an automatic adjustment multiple-stride iteration method, significantly increasing the PDE convergence speed. A dynamic-precision near-memory-computing architecture with booth encoding is proposed to reduce iterated intermediate data movement. A customized 32T compressor and a 14T full adder are designed to reduce the power and hardware cost of the solver. The processor is fabricated using 65-nm CMOS technology and occupies a 6.25 mm2 die area. It can achieve a convergence speedup by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4\times $ </tex-math></inline-formula> compared with the existing work.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Published
2024-09-26
DOI
https://doi.org/10.1109/tvlsi.2024.3458801
Citations
2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.72

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Fast-Convergence Near-Memory-Computing Accelerator for Solving Partial Differential Equations

Zhuang Shao, Chenjia Xie, Li Du, Xingyuan Hu et al.
2 citations
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Matrix Theory and Algorithms
0.72
article

A Fast-Convergence Near-Memory-Computing Accelerator for Solving Partial Differential Equations

Zhuang Shao, Chenjia Xie, Li Du, Xingyuan Hu, Yuan Du, Ning Bo Zhao
article en
2 citations

Abstract

Solving partial differential equations (PDEs) is omnipresent in scientific research and engineering and requires expensive numerical iteration for memory and computation. The primary concerns for solving PDEs are convergence speed, data movement, and power consumption. This work proposed the first fast-convergence PDE solver with an automatic adjustment multiple-stride iteration method, significantly increasing the PDE convergence speed. A dynamic-precision near-memory-computing architecture with booth encoding is proposed to reduce iterated intermediate data movement. A customized 32T compressor and a 14T full adder are designed to reduce the power and hardware cost of the solver. The processor is fabricated using 65-nm CMOS technology and occupies a 6.25 mm2 die area. It can achieve a convergence speedup by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4\times $ </tex-math></inline-formula> compared with the existing work.

IEEE Transactions on Very Large Scale Integration (VLSI) SystemsVol. 33(2)
Nanjing University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 26%
Matrix Theory and Algorithms
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.