Jinyi Deng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jinyi Deng has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Yang Hu
Tsinghua University
9 shared publications - Shouyi Yin
Tsinghua University
7 shared publications - Xinru Tang
School of Integrated Circuits, Tsinghua University, Beijing, China
4 shared publications - Chao Li
Shanghai Jiao Tong University, Shanghai, China
3 shared publications - Jiahao Zhang
Tsinghua University, Beijing, China
3 shared publications - Shaojun Wei
Tsinghua University
3 shared publications
Latest Publications
- 24 August 2026
- Published by Springer Nature
- p. 579-585
WaferSim: A Simulation Infrastructure for LLM Service on Wafer-Scale Chips
- 24 August 2026
- Published by Springer Nature
- p. 579-585
WaferSim: A Simulation Infrastructure for LLM Service on Wafer-Scale Chips
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
WSC-Cost: An Accurate Cost Modeling Framework for Wafer-Scale Chips
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessWSC-Cost: An Accurate Cost Modeling Framework for Wafer-Scale Chips
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Stone-Skimming: Attacking Big-Data Analytics Applications with Page Table Walk
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessStone-Skimming: Attacking Big-Data Analytics Applications with Page Table Walk
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 222-225
BISC: Rethinking Instruction Set Abstractions at Block Granularity
Most widely deployed ISAs for general-purpose processors expose a centralized register file and instruction-granular control flow, forcing modern CPUs to rely on complex microarchitectural mechanisms to reconcile execution with architectural state. Even in simple in-order designs, these abstractions impose back-and-forth execution overheads, while more aggressive processors further amplify them through register renaming, speculation, and in-order retirement. This letter presents the Block-based Instruction Set Computer (BISC), which rethinks ISA abstractions at block granularity. BISC eliminates architectural destination registers by binding each instruction's result to its position within a block, enabling block-local execution driven by operand availability while preserving control-flow semantics across blocks. Control flow is resolved at block entry, amortizing fetch and control overhead across multiple operations and enabling efficient expression of conditional selection without additional control-flow edges. We evaluate BISC using a single-issue in-order core with comparable area to a RISC-V baseline. Despite executing more operations and incurring a larger code footprint, BISC achieves a 34% geometric mean speedup across benchmarks. These results demonstrate that ISA-level execution abstractions play a critical role in processor efficiency, independent of microarchitectural optimizations.
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 222-225
BISC: Rethinking Instruction Set Abstractions at Block Granularity
Most widely deployed ISAs for general-purpose processors expose a centralized register file and instruction-granular control flow, forcing modern CPUs to rely on complex microarchitectural mechanisms to reconcile execution with architectural state. Even in simple in-order designs, these abstractions impose back-and-forth execution overheads, while more aggressive processors further amplify them through register renaming, speculation, and in-order retirement. This letter presents the Block-based Instruction Set Computer (BISC), which rethinks ISA abstractions at block granularity. BISC eliminates architectural destination registers by binding each instruction's result to its position within a block, enabling block-local execution driven by operand availability while preserving control-flow semantics across blocks. Control flow is resolved at block entry, amortizing fetch and control overhead across multiple operations and enabling efficient expression of conditional selection without additional control-flow edges. We evaluate BISC using a single-issue in-order core with comparable area to a RISC-V baseline. Despite executing more operations and incurring a larger code footprint, BISC achieves a 34% geometric mean speedup across benchmarks. These results demonstrate that ISA-level execution abstractions play a critical role in processor efficiency, independent of microarchitectural optimizations.
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 631-645
Cramming a Data Center into One Cabinet, a Co-Exploration of Computing and Hardware Architecture of Waferscale Chip
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 631-645
Open AccessCramming a Data Center into One Cabinet, a Co-Exploration of Computing and Hardware Architecture of Waferscale Chip
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 49-64
PD Constraint-aware Physical/Logical Topology Co-Design for Network on Wafer
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 49-64
Open AccessPD Constraint-aware Physical/Logical Topology Co-Design for Network on Wafer
- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (1) , 185-199
Rethinking Control Flow in Spatial Architectures: Insights Into Control Flow Plane Design
Spatial architecture is a high-performance paradigm that employs control flow graphs and data flow graphs as computation model, and producer/consumer models as execution model. However, existing spatial architectures struggle with control flow handling challenges. Upon thoroughly characterizing their PE execution models, we observe that they lack autonomous, peer-to-peer, and temporally loosely-coupled control flow handling capability. This degrades its performance in intensive control programs. To tackle the existing control flow handling challenges, Marionette, a spatial architecture with an explicit-designed control flow plane, is proposed. We elaborately develop a full stack of Marionette architecture, from ISA, compiler, simulator to RTL. Marionette's flexible Control Flow Plane enables autonomous, peer-to-peer, and temporally loosely-coupled control flow management. Its Proactive PE Configuration ensures computation-overlapped and timely configuration to promote Branch Divergence handling capability. Besides, Marionette's Agile PE Assignment improves pipeline performance of imperfect loops. Compared to state-of-the-art spatial architectures, the experimental results demonstrate that Marionette outperforms Softbrain, TIA, REVEL, and RipTide by geomean 2.88$\mathbf{\times}$ , 3.38$\mathbf{\times}$ , 1.55$\mathbf{\times}$ , and 2.66$\mathbf{\times}$ in a variety of challenging intensive control programs.- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (1) , 185-199
Rethinking Control Flow in Spatial Architectures: Insights Into Control Flow Plane Design
Spatial architecture is a high-performance paradigm that employs control flow graphs and data flow graphs as computation model, and producer/consumer models as execution model. However, existing spatial architectures struggle with control flow handling challenges. Upon thoroughly characterizing their PE execution models, we observe that they lack autonomous, peer-to-peer, and temporally loosely-coupled control flow handling capability. This degrades its performance in intensive control programs. To tackle the existing control flow handling challenges, Marionette, a spatial architecture with an explicit-designed control flow plane, is proposed. We elaborately develop a full stack of Marionette architecture, from ISA, compiler, simulator to RTL. Marionette's flexible Control Flow Plane enables autonomous, peer-to-peer, and temporally loosely-coupled control flow management. Its Proactive PE Configuration ensures computation-overlapped and timely configuration to promote Branch Divergence handling capability. Besides, Marionette's Agile PE Assignment improves pipeline performance of imperfect loops. Compared to state-of-the-art spatial architectures, the experimental results demonstrate that Marionette outperforms Softbrain, TIA, REVEL, and RipTide by geomean 2.88$\mathbf{\times}$ , 3.38$\mathbf{\times}$ , 1.55$\mathbf{\times}$ , and 2.66$\mathbf{\times}$ in a variety of challenging intensive control programs.- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Artificial Intelligence
- Vol. 1 (2) , 229-243
Efficient Orchestrated AI Workflows Execution on Scale-Out Spatial Architecture
Given the increasing complexity of AI applications, traditional spatial architectures frequently fall short. Our analysis identifies a pattern of interconnected, multi-faceted tasks encompassing both AI and general computational processes. In response, we have conceptualized “Orchestrated AI Workflows,” an approach that integrates various tasks with logic-driven decisions into dynamic, sophisticated workflows. Specifically, we find that the intrinsic Dual Dynamicity of Orchestrated AIWorkflows, namely dynamic execution times and frequencies of Task Blocks, can be effectively represented using the Orchestrated Workflow Graph. Furthermore, the intrinsic Dual Dynamicity poses challenges to existing spatial architecture, namely Indiscriminate Resource Allocation, Reactive Load Rebalancing, and Contagious PEA Idleness. To overcome these challenges, we present Octopus, a scale-out spatial architecture and a suite of advanced scheduling strategies optimized for executing Orchestrated AI Workflows, such as the Discriminate Dual-Scheduling Mechanism, Adaptive Task Block Processing Unit (TBU) Scheduling Strategy, and Proactive Cluster Scheduling Strategy. Our evaluations demonstrate that Octopus significantly outperforms traditional architectures in handling the dynamic demands of Orchestrated AI Workflows, and possesses robust scalability in large scale hardware such as wafer-scale chip.
- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Artificial Intelligence
- Vol. 1 (2) , 229-243
Efficient Orchestrated AI Workflows Execution on Scale-Out Spatial Architecture
Given the increasing complexity of AI applications, traditional spatial architectures frequently fall short. Our analysis identifies a pattern of interconnected, multi-faceted tasks encompassing both AI and general computational processes. In response, we have conceptualized “Orchestrated AI Workflows,” an approach that integrates various tasks with logic-driven decisions into dynamic, sophisticated workflows. Specifically, we find that the intrinsic Dual Dynamicity of Orchestrated AIWorkflows, namely dynamic execution times and frequencies of Task Blocks, can be effectively represented using the Orchestrated Workflow Graph. Furthermore, the intrinsic Dual Dynamicity poses challenges to existing spatial architecture, namely Indiscriminate Resource Allocation, Reactive Load Rebalancing, and Contagious PEA Idleness. To overcome these challenges, we present Octopus, a scale-out spatial architecture and a suite of advanced scheduling strategies optimized for executing Orchestrated AI Workflows, such as the Discriminate Dual-Scheduling Mechanism, Adaptive Task Block Processing Unit (TBU) Scheduling Strategy, and Proactive Cluster Scheduling Strategy. Our evaluations demonstrate that Octopus significantly outperforms traditional architectures in handling the dynamic demands of Orchestrated AI Workflows, and possesses robust scalability in large scale hardware such as wafer-scale chip.
- Open Access
- 28 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1395-1408
Towards Efficient Control Flow Handling in Spatial Architecture via Architecting the Control Flow Plane
Spatial architecture is a high-performance architecture that uses control flow graphs and data flow graphs as the computational model and producer/consumer models as the execution models. However, existing spatial architectures suffer from control flow handling challenges. Upon categorizing their PE execution models, we find that they lack autonomous, peer-to-peer, and temporally loosely-coupled control flow handling capability. This leads to limited performance in intensive control programs. A spatial architecture, Marionette, is proposed, with an explicit-designed control flow plane. The Control Flow Plane enables autonomous, peer-to-peer and temporally loosely-coupled control flow handling. The Proactive PE Configuration ensures computation-overlapped and timely configuration to improve handling Branch Divergence. The Agile PE Assignment enhance the pipeline performance of Imperfect Loops. We develop full stack of Marionette (ISA, compiler, simulator, RTL) and demonstrate that in a variety of challenging intensive control programs, compared to state-of-the-art spatial architectures, Marionette outperforms Softbrain, TIA, REVEL, and RipTide by geomean 2.88×, 3.38×, 1.55×, and 2.66×.
- 28 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1395-1408
Open AccessTowards Efficient Control Flow Handling in Spatial Architecture via Architecting the Control Flow Plane
Spatial architecture is a high-performance architecture that uses control flow graphs and data flow graphs as the computational model and producer/consumer models as the execution models. However, existing spatial architectures suffer from control flow handling challenges. Upon categorizing their PE execution models, we find that they lack autonomous, peer-to-peer, and temporally loosely-coupled control flow handling capability. This leads to limited performance in intensive control programs. A spatial architecture, Marionette, is proposed, with an explicit-designed control flow plane. The Control Flow Plane enables autonomous, peer-to-peer and temporally loosely-coupled control flow handling. The Proactive PE Configuration ensures computation-overlapped and timely configuration to improve handling Branch Divergence. The Agile PE Assignment enhance the pipeline performance of Imperfect Loops. We develop full stack of Marionette (ISA, compiler, simulator, RTL) and demonstrate that in a variety of challenging intensive control programs, compared to state-of-the-art spatial architectures, Marionette outperforms Softbrain, TIA, REVEL, and RipTide by geomean 2.88×, 3.38×, 1.55×, and 2.66×.