Clock-aware ultrascale FPGA placement with machine learning routability prediction: (Invited paper)
Authors:
- 1 November 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 929-936
Abstract
As the complexity and scale of circuits keep growing, clocking architectures of FPGAs have become more complex to meet the timing requirement. In this paper, to optimize wirelength and meanwhile meet emerging clocking architectural constraints, we propose several detailed placement techniques, i.e., two-step clock constraint legalization and chain move. After integrating these techniques into our FPGA placement framework, experimental results on ISPD 2017 benchmarks show that our proposed approach yields 2.3% shorter routed wirelength and the running time is 2x faster compared to the first place winner in the ISPD 2017 contest. Moreover, we explore the possibilities to use machine learning-based methods to predict routing congestion in UltraScale FPGAs. Experimental results on both ISPD 2016 and ISPD 2017 benchmarks show that our proposed congestion estimation model is a good approximation to the one obtained from Vivado and can lead to good placement results compared to the previous methods.Keywords
This publication has 20 references indexed in Scilit:
- Routability Optimization for Industrial Designs at Sub-14nm Process Nodes Using Machine Learning2017
- VTR 7.0ACM Transactions on Reconfigurable Technology and Systems, 2014
- Rent's rule based FPGA packing for routability optimization2014
- Analytical placement for heterogeneous FPGAs2012
- SimPL: An Effective Placement AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- StarPlace: A new analytic method for FPGA placementIntegration, 2011
- Improving Timing-Driven FPGA Packing with Physical Information2007
- Un/DoPack: Re-Clustering of Large System-on-Chip Designs with Interconnect Variation for Low-Cost FPGAs2006 IEEE/ACM International Conference on Computer Aided Design, 2006
- A Congestion Driven Placement Algorithm for FPGA Synthesis2006
- Timing-driven partitioning-based placement for island style FPGAsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005