Automated Floorplanning for Partially Reconfigurable Designs on Heterogenrous FPGAs
Pingakshya Goswami, Dinesh Bhatia

TL;DR
This paper introduces a novel floorplanner for partially reconfigurable heterogeneous FPGAs that optimizes resource allocation, reduces wire length, and improves efficiency, demonstrated on Xilinx architectures and benchmarks.
Contribution
The paper presents a new floorplanning approach for heterogeneous FPGAs with partial reconfiguration, including a white space detection algorithm and integration with existing tools.
Findings
Significant reduction in wire length compared to previous methods.
Improved execution time and resource utilization.
Successful integration with Xilinx Vivado for automation.
Abstract
Floorplanning problem has been extensively explored for homogeneous FPGAs. Most modern FPGAs consist of heterogeneous resources in the form of configurable logic blocks, DSP blocks, BRAMs and more. Very little work has been done for heterogeneous FPGAs. In addition, features like partial reconfigurability allow on-the-fly changes to the executable design that can result in enhanced performance and very efficient utilization of resources. In this paper, we have designed a floorplanner for Partially Reconfigurable (PR) designs in FPGA that smartly decides one of the three proposed resource allocation schemes to floorplan a particular type of reconfigurable region. We also propose a White Space Detection algorithm for efficient management of white space inside an FPGA in order to reduce the area and the wire length. The floorplanner is demonstrated on Xilinx Virtex 5 and Artix 7 FPGA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
