paper-with-me

홈 › Papers

DPUV4E: High-Throughput DPU Architecture Design for CNN on Versal ACAP

2025-06-13 · Guoyu Li, Pengbo Zheng, Jian Weng, Enshan Yang

Convolutional Neural Networks (CNNs) remain prevalent in computer vision applications, and FPGAs, known for their flexibility and energy efficiency, have become essential components in heterogeneous acceleration systems. However, traditional FPGAs face challenges in balancing performance and versatility due to limited on-chip resources. AMD's Versal ACAP architecture, tailored for AI applications, incorporates AI Engines (AIEs) to deliver high computational power. Nevertheless, the platform suffers from insufficient memory bandwidth, hindering the full utilization of the AIEs' theoretical performance. In this paper, we present DPUV4E for the Versal architecture, providing configurations ranging from 2PE ($32.6$ TOPS) to 8PE ($131.0$ TOPS). We design two computation units, Conv PE and DWC PE, to support different computational patterns. Each computation unit's data flow efficiently utilizes the data reuse opportunities to mitigate bandwidth bottlenecks. Additionally, we extend the functionality of each PE to utilize AIEs for non-convolutional operations, reducing resource overhead. Experiments on over 50 models show that compared to previous designs, our design provides $8.6\times$ the TOPS/W of traditional FPGA-based DPU designs, while reducing DSP usage by $95.8\%$, LUT usage by $44.7\%$, and latency to $68.5\%$ under single-batch conditions. For end-to-end inference, our design improving throughput by up to $2.2\times$ for depth-wise convolution models and up to $1.3\times$ for standard models.

📄 PDF Abstract BibTeX arXiv:2506.11441

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

DPUV3INT8: A Compiler View to programmable FPGA Inference Engines

2021-10-08 · Paolo D'Alberto, Jiangsha Ma, Jintao Li, Yiming Hu 외

We have a FPGA design, we make it fast, efficient, and tested for a few important examples. Now we must infer a general solution to deploy in the data center. Here, we describe the FPGA DPUV3INT8 design and our compiler …

Real-Time Graph-based Point Cloud Networks on FPGAs via Stall-Free Deep Pipelining

2025-07-07 · Marc Neu, Isabel Haide, Timo Justinger, Till Rädler 외

Graph-based Point Cloud Networks (PCNs) are powerful tools for processing sparse sensor data with irregular geometries, as found in high-energy physics detectors. However, deploying models in such environments remains ch…

GPU

Differentiable Voronoi Ray Tracing Beyond Rasterization Speeds

2026-08-18 · Bernardo Taveira, Carl Lindström, Joakim Johnander, Fredrik Kahl arxiv

Real-time novel view synthesis is dominated by rasterized explicit primitives. These projection-based pipelines provide high throughput but require specialized extensions for non-pinhole effects such as distortion, rolli…

Novel View Synthesis

TurboViT: Generating Fast Vision Transformers via Generative Architecture Search

2023-08-22 · Alexander Wong, Saad Abbasi, Saeejith Nair

Vision transformers have shown unprecedented levels of performance in tackling various visual perception tasks in recent years. However, the architectural and computational complexity of such network architectures have m…

Computational Efficiency

HEPPO: Hardware-Efficient Proximal Policy Optimization -- A Universal Pipelined Architecture for Generalized Advantage Estimation

2025-01-22 · Hazem Taha, Ameer M. S. Abdelhadi

This paper introduces HEPPO, an FPGA-based accelerator designed to optimize the Generalized Advantage Estimation (GAE) stage in Proximal Policy Optimization (PPO). Unlike previous approaches that focused on trajectory co…

CPUGPUQuantization