AceRoute: Adaptive Compute-Efficient FPGA Routing with Pluggable Intra-Connection Bidirectional Exploration
This paper introduces AceRoute, an adaptive compute-efficient FPGA router that tackles the long-standing issue of lengthy FPGA compilation times given complicated FPGA architectures and designs to synthesize. We thoroughly profile modern FPGA routing patterns and identify the runtime hotspot: routing bottleneck connections in congested designs. However, previous works on routing acceleration hardly target mitigating connection-wise routing difficulties by characterizing device resource expansions and shifting path-exploration modes of connections.
Authors
- Jiaxi Zhang (ORCID: https://orcid.org/0000-0001-6599-6142)
- Sunan Zou (ORCID: https://orcid.org/0000-0003-0949-4222)
- Guojie Luo (ORCID: https://orcid.org/0000-0003-4932-3655)
- Xinming Wei (ORCID: https://orcid.org/0009-0009-0395-2887)
- Ping Fan
- Jiahao Zhang (ORCID: https://orcid.org/0000-0003-2097-0840)
- Kaiwen Sun
- Z Y Zhang (ORCID: https://orcid.org/0009-0000-2763-0123)
Institutions
- Peking University (CN)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1145/3676536.3676709
- Primary Topic
- VLSI and FPGA Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China