PASTA: Programming and Automation Support for Scalable Task-Parallel HLS Programs on Modern Multi-Die FPGAs
Open Access
- 30 September 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 17 (3) , 1-31
Abstract
In recent years, the adoption of FPGAs in datacenters has increased, with a growing number of users choosing High-Level Synthesis (HLS) as their preferred programming method. While HLS simplifies FPGA programming, one notable challenge arises when scaling up designs for modern datacenter FPGAs that comprise multiple dies. The extra delays introduced due to die crossings and routing congestion can significantly degrade the frequency of large designs on these FPGA boards. Due to the gap between HLS design and physical design, it is challenging for HLS programmers to analyze and identify the root causes, and fix their HLS design to achieve better timing closure. Recent efforts have aimed to address these issues by employing coarse-grained floorplanning and pipelining strategies on task-parallel HLS designs where multiple tasks run concurrently and communicate through FIFO stream channels. However, many applications are not streaming friendly and many existing accelerator designs heavily rely on buffer channel based communication between tasks.In this work, we take a step further to support a task-parallel programming model where tasks can communicate via both FIFO stream channels and buffer channels. To achieve this goal, we design and implement the PASTA framework, which takes a large task-parallel HLS design as input and automatically generates a high-frequency FPGA accelerator via HLS and physical design co-optimization. Our framework introduces a latency-insensitive buffer channel design, which supports memory partitioning and ping-pong buffering while remaining compatible with vendor HLS tools. On the frontend, we provide an easy-to-use programming model for utilizing the proposed buffer channel; while on the backend, we implement efficient placement and pipelining strategies for the proposed buffer channel. To validate the effectiveness of our framework, we test it on four widely used Rodinia HLS benchmarks and two real-world accelerator designs and show an average frequency improvement of 25%, with peak improvements of up to 89% on AMD/Xilinx Alveo U280 boards compared to Vitis HLS baselines.Keywords
This publication has 33 references indexed in Scilit:
- MapBuf: Simultaneous Technology Mapping and Buffer Insertion for HLS Performance Optimization2023
- PASTA: Programming and Automation Support for Scalable Task-Parallel HLS Programs on Modern Multi-Die FPGAs2023
- High-Level Annotation of Routing Congestion for Xilinx Vivado HLS DesignsIEEE Access, 2021
- Caffeine: Toward Uniformed Representation and Acceleration for Deep Convolutional Neural NetworksIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018
- TAPAS: Generating Parallel Accelerators from Parallel Programs2018
- Fast and effective placement and routing directed high-level synthesis for FPGAs2014
- LegUpACM Transactions on Embedded Computing Systems, 2013
- High-Level Synthesis for FPGAs: From Prototyping to DeploymentIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- Fast Unified Floorplan Topology Generation and Sizing on Heterogeneous FPGAsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2009
- Floorplan design for multi-million gate FPGAs2005