Better Together: Combining Analytical and Annealing Methods for FPGA Placement

RS Rajarathnam, K Thurmer, V Betz… - … Conference on Field …, 2024 - ieeexplore.ieee.org
Placement is a critical step in the FPGA design implementation flow that strongly impacts
routability and timing closure. Recent state-of-the-art academic analytical placers have …

OpenPARF 3.0: Robust Multi-Electrostatics Based FPGA Macro Placement Considering Cascaded Macros Groups and Fence Regions

J Mai, J Wang, Y Chen, Z Guo, X Jiang… - … of Electronics Design …, 2024 - ieeexplore.ieee.org
FPGA macro placement exerts a significant influence on routability and timing closure in
FPGA physical design. Macros could subject to cascaded macro constraints and necessitate …

A Routability-Driven Ultrascale FPGA Macro Placer with Complex Design Constraints

Q Luo, X Zang, Q Wang, F Wang… - 2024 IEEE 32nd …, 2024 - ieeexplore.ieee.org
Macro placement significantly influences the performance of the FPGA placement. However,
constraints in modern designs like relative placement constraint (RPC) and regional …

Late Breaking Results: Routability-Driven FPGA Macro Placement Considering Complex Cascade Shape and Region Constraints

H Gu, J Gu, K Peng, J Yang, Z Zhu - Proceedings of the 61st ACM/IEEE …, 2024 - dl.acm.org
Field-programmable gate array (FPGA) macro placement holds a crucial role within the
FPGA physical design flow since it substantially influences the subsequent stages of cell …

[PDF][PDF] MORPH: More Robust ASIC Placement for Hybrid Region Constraint Management

J Mai, Z Zhang, Y Lin, R Wang, R Huang - 2024 - magic3007.github.io
Modern ASIC placement tools encompass three categories of region constraints: default
regions, fence regions, and guide regions. Region constraints pose significant challenges to …

[PDF][PDF] Software-like Incremental Refinement on FPGA using Partial Reconfiguration

DDJ Park - 2024 - dj-park.github.io
1.1. Thesis Through the fast and flexible FPGA compilation using Hierarchical Partial
Reconfiguration, FPGA design-space exploration can be accelerated up to 2.7×, resulting in …