Jian Weng

Mr. Jian Weng

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 July 2022 in IEEE Micro
Verified
Journal Article
Closed access
JWJian Weng
Jian Weng
SLSihao Liu
Sihao Liu
DKDylan Kupsh
Dylan Kupsh
TNTony Nowatzki
Tony Nowatzki
Spatial accelerators provide high performance, energy efficiency, and flexibility. Recent design frameworks enable these architectures to be quickly designed and customized to a domain. However, constructing a compiler for this immense design space is challenging, first because accelerators express programs with high-level idioms that are difficult to recognize. Second, it is unpredictable whether certain transformations are beneficial or will lead to infeasible hardware mappings. Our work develops a general spatial-accelerator compiler with two key ideas. First, we propose an approach to recognize and represent useful dataflow idioms, along with a novel idiomatic memory representation. Second, we propose the principle of modular compilation, which combines hardware-aware transformation selection and an iterative approach to handle uncertainty. Our compiler achieves 2.3× speedup, and 98.7× area-normalized speedup over high-end server CPU.

20 November 2024 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
SMSiyuan Ma
Siyuan Ma
KMKaustubh Mhatre
Kaustubh Mhatre
JWJian Weng
Jian Weng
BHBagus Hanindhito
Bagus Hanindhito
ZWZhengrong Wang
Zhengrong Wang
AAAman Arora
Aman Arora
Bit-serial Processing-In-Memory (PIM) is an attractive paradigm for accelerator architectures, for parallel workloads such as Deep Learning (DL), because of its capability to achieve massive data parallelism at a low area overhead and provide orders-of-magnitude data movement savings by moving computational resources closer to the data. While many PIM architectures have been proposed, improvements are needed in communicating intermediate results to consumer kernels, for communication between tiles at scale, for reduction operations, and for efficiently performing bit-serial operations with constants. We present PIMSAB, a scalable architecture that provides a spatially aware communication network for efficient intra-tile and inter-tile data movement and provides efficient computation support for generally inefficient bit-serial compute patterns. Our architecture consists of a massive hierarchical array of compute-enabled SRAMs (CRAMs), which is codesigned with a compiler to achieve high utilization. The key novelties of our architecture are (1) in providing efficient support for spatially aware communication by providing local H-tree network for reductions, by adding explicit hardware for shuffling operands, and by deploying systolic broadcasting, as well as (2) by taking advantage of the divisible nature of bit-serial computations through adaptive precision and efficient handling of constant operations. These innovations are integrated into a tensor expressions-based programming framework (including a compiler for easy programmability) that enables simple programmer control of optimizations for mapping programs into massively parallel binaries for millions of PIM processing elements. When compared against a similarly provisioned modern Tensor Core GPU (NVIDIA A100), across common DL kernels and end-to-end DL networks (Resnet18 and BERT), PIMSAB outperforms the GPU by 4.80×, and reduces energy by 3.76×. We compare PIMSAB with similarly provisioned state-of-the-art SRAM PIM (Duality Cache) and DRAM PIM (SIMDRAM), and observe a speedup of 3.7× and 3.88×, respectively.

20 June 2025
Verified
Conference Paper
Open access
JWJian Weng
Jian Weng
BHBoyang Han
Boyang Han
DGDerui Gao
Derui Gao
RGRuijie Gao
Ruijie Gao
WZWanning Zhang
Wanning Zhang
MCMarco Canini
Marco Canini

16 April 2020 in IEEE Micro
Verified
Journal Article
Closed access
VDVidushi Dadu
Vidushi Dadu
JWJian Weng
Jian Weng
SLSihao Liu
Sihao Liu
TNTony Nowatzki
Tony Nowatzki
Programmable hardware accelerators (eg. vector processors, GPUs) have been extremely successful at targeting algorithms with regular control and memory patterns to achieve order-of-magnitude performance and energy efficiency improvements. However, they perform far under the peak on important irregular algorithms, like those from graph processing, database querying, genomics, advanced machine learning, and others. This work posits that the primary culprit is specific forms of irregular control flow and memory access. By capturing the problematic behavior at a domain-agnostic level, we propose an accelerator that is sufficiently general, matches domain-specific accelerator performance, and significantly outperforms traditional CPUs and GPUs.

3 April 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
YLYanan Lu
Yanan Lu
LLLeibo Liu
Leibo Liu
Yangdong DengYangdong Deng
Yangdong Deng
JWJian Weng
Jian Weng
SYShouyi Yin
Shouyi Yin
SWShaojun Wei
Shaojun Wei
Distributed controlled coarse-grained reconfigurable arrays (CGRAs) enable efficient execution of irregular control flows by reconciling divergence in the processing elements (PEs). To further improve performance by better exploiting spatial parallelism, the triggered instruction architecture (TIA) eliminates the program counter and branch instructions by converting control flows into predicate dependencies as triggers. However, pipeline stalls, which occur in pipelines composed of both intra and inter-PEs, remain a major obstacle to the overall performance. In fact, the stalls in distributed controlled CGRAs pose a unique problem that is difficult to resolve by previous techniques. This work presents a triggered-issuance and triggered-execution (TITE) paradigm in which the issuance and execution of instructions are separately triggered to further relax the predicate dependencies in TIA. In this paradigm, instructions are paired as dual instructions to eliminate stalls caused by control divergence. Tags that identify the data transmitted between PEs are forwarded for acceleration. As a result, pipeline stalls of both intra- and inter-PEs can be significantly minimized. Experiments show that TITE improves performance by 21 percent, energy efficiency by 17 percent, and area efficiency by 12 percent compared with a baseline TIA.

24 August 2026
Verified
Book Chapter
Closed access
PDF file
ZXZheng Xu
Zheng Xu
JLJiaxin Liu
Jiaxin Liu
DKDehao Kong
Dehao Kong
JFJiamu Fu
Jiamu Fu
XDXu Dai
Xu Dai
SYShouyi Yin
Shouyi Yin