Abstract
Effectively estimating and managing congestion during placement can save substantial placement and routing runtime. In this article, we present a machine-learning model for accurately and efficiently estimating congestion during FPGA placement. Compared with the state-of-the-art machine-learning congestion-estimation model, our results show a 25% improvement in prediction accuracy. This makes our model competitive with congestion estimates produced using a global router. However, our model runs, on average, 291× faster than the global router. Overall, we are able to reduce placement runtimes by 17% and router runtimes by 19%. An additional machine-learning model is also presented that uses the output of the first congestion-estimation model to determine whether or not a placement is routable. This second model has an accuracy in the range of 93% to 98%, depending on the classification algorithm used to implement the learning model, and runtimes of a few milliseconds, thus making it suitable for inclusion in any placer with no worry of additional computational overhead.
- Z. Abuowaimer, D. Maarouf, T. Martin, J. Foxcroft, G. Grewal, S. Areibi, and A. Vannelli. 2018. GPLace3.0: Routability driven analytic placer for UltraScale FPGA architectures. ACM Trans. Des. Auto. Electron. Syst. 23, 5 (Aug. 2018), 66:1--66:3. Google Scholar
Digital Library
- E. Bozorgzadeh, S. Memik, X. Yang, and M. Sarrafzadeh. 2004. Routability-driven packing: Metrics and algorithms for cluster-based FPGAs. J. Circ., Syst. Comput. 13, 1 (June 2004), 77--100.Google Scholar
Cross Ref
- Leo Breiman. 2001. Random forests. Machine Learn. 45, 1 (2001), 5--32. Google Scholar
Digital Library
- P. Chan, M. Schlag, and J. Zien. 1993. On routability prediction for field programmable gate arrays. In Proceedings of the Design Automation Conference. 326--330. Google Scholar
Digital Library
- W. Chan, P. Ho, A. Kahng, and P. Saxena. 2017. Routability optimization for industrial designs at sub-14nm process nodes using machine learning. In Proceedings of the International Symposium on Physical Design. 15--21. Google Scholar
Digital Library
- W. T. J. Chan, Y. Du, A. B. Kahng, S. Nath, and K. Samadi. 2016. BEOL stack-aware routability prediction from placement using data mining techniques. In Proceedings of the International Conference on Computer Design (ICCD’16). 41--48.Google Scholar
- Thomas Cover and Peter Hart. 1967. Nearest neighbor pattern classification. IEEE Trans. Inform. Theor. 13, 1 (1967), 21--27. Google Scholar
Digital Library
- F. Pedregosa et al. 2011. Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12 (Nov. 2011), 2825--2830. Retrieved from: http://dl.acm.org/citation.cfm?id=1953048.2078195. Google Scholar
Digital Library
- G. Grewal and S. Areibi. {n.d.}. Guelph FPGA CAD Group. Retrieved from: http://fpga.socs.uoguelph.ca/.Google Scholar
- G. Grewal, S. Areibi, M. Westrik, Z. Abuowaimer, and B. Zhao. 2017. Automatic flow selection and quality-of-result estimation for FPGA placement. In Proceedings of the 24th Reconfigurable Architectures Workshop. 115--123.Google Scholar
- PariVallal Kannan, Shankar Balachandran, and Dinesh Bhatia. 2001. fGREP—Fast generic routing demand estimation for placed FPGA circuits. In Proceedings of the International Conference on Field-Programmable Logic and Applications. Springer-Verlag, 37--47. Google Scholar
Digital Library
- P. Kannan, S. Calachandran, and D. Bhatia. 2004. On metrics for comparing interconnect estimation methods for FPGAs. IEEE Trans. VLSI (Apr. 2004), 381--385. Google Scholar
Digital Library
- W. Li and D. Banerji. 1999. Routability prediction for hierarchical FPGAs. In Proceedings of the Great Lakes Symposium on VLSI. 1066--1395. Google Scholar
Digital Library
- W. Li and D. Banerji. 2001. Tightly integrated placement and routing for FPGAs. In Proceedings of the International Conference on Field Programmable Logic and Applications. 233--242. Google Scholar
Digital Library
- W. Li, S. Dhar, and D. Pan. 2018. UTPlaceF: A routability-driven FPGA placer with physical and congestion aware packing. IEEE Trans. CAD Syst. 37, 4 (2018), 869--882. Google Scholar
Digital Library
- Wuxi Li, Shounak Dhar, and David Z. Pan. 2016. UTPlaceF: A routability-driven FPGA placer with physical and congestion aware packing. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD’16). 66:1--66:7. Google Scholar
Digital Library
- D. Maarouf, A. Alhyari, Z. Abuowaimer, T. Martin, G. Grewal, S. Areibi, and A. Vannelli. 2018. A machine learning congestion estimation model for modern FPGAs. In Proceedings of the IEEE International Conference on Field Programmable Logic and Applications. 1--8.Google Scholar
- Larry McMurchie and Carl Ebeling. {n.d.}. PathFinder: A negotiation-based performance-driven router for FPGAs. In Proceedings of the 3rd ACM International Symposium on Field Programmable Gate Arrays. 111--117. Google Scholar
Digital Library
- Sreerama K. Murthy. 1997. Automatic construction of decision trees from data: A multidisciplinary survey. Data Mining and Knowledge Discovery 2 (1997), 345--389. Google Scholar
Digital Library
- R. Pattison, Z. Abuowaimer, S. Areibi, G. Grewal, and A. Vannelli. 2016. Invited paper: GPlace—A congestion-aware placement tool for UltraScale FPGAs. In Proceedings of the International Conference on Computer-Aided Design. 1--7. Google Scholar
Digital Library
- C. Pui, G. Chen, W. Chow, K. Lam, P. Tu, H. Zhang, E. Young, and B. Yu. 2016. RippleFPGA: A routability-driven placement for large-scale heterogeneous FPGAs. In Proceedings of the International Conference on Computer-Aided Design. 1--8. Google Scholar
Digital Library
- C. Pui, G. Chen, Y. Ma, E. Young, and B. Yu. 2017. Clock-aware UltraScale FPGA placement with machine learning routability prediction. In Proceedings of the International Conference on Computer-Aided Design. ACM, 929--936. Google Scholar
Digital Library
- Z. Qi, Y. Cai, and Q. Zhou. 2014. Accurate prediction of detailed routing congestion using supervised data learning. In Proceedings of the IEEE International Conference on Computer Design. 97--103.Google Scholar
- David E. Rumelhart, Geoffrey E. Hinton, and Ronald J. Williams. 1985. Learning Internal Representations by Error Propagation. Technical Report. University of California-San Diego, La Jolla Institute for Cognitive Science.Google Scholar
- J. Swartz, V. Betz, and J. Rose. 1998. A fast routability-driven router for FPGAs. In Proceedings of the International Symposium on FPGAs. ACM, 140--149. Google Scholar
Digital Library
- Vladimir Vapnik. 2013. The Nature of Statistical Learning Theory. Springer Science 8 Business Media.Google Scholar
- R. Wood and R. Rutenbar. 1998. FPGA routing and routability estimation via Boolean satisfiability. IEEE Trans. VLSI Systems 6, 2 (June 1998), 222--231. Google Scholar
Digital Library
- Xilinx. {n.d.}. A Tcl-based CAD Tool Framework for Xilinx’s Vivado Design Suite. Retrieved from: https://github.com/byuccl/tincr.Google Scholar
- Xilinx. {n.d.}. ISPD 2016 Routability-Driven FPGA Placement Contest. Retrieved from: http://www.ispd.cc/contests/16/ispd2016_contest.html. Google Scholar
Digital Library
- Xilinx. {n.d.}. UltraScale Architecture Configurable Logic Block User Guide. Retrieved from: http://www.xilinx.com/support/documentation/user_guides/ug574-ultrascale-clb.pdf.Google Scholar
- M. Xu, G. Grewal, and S. Areibi. 2011. StarPlace: A new analytic method for FPGA placement. Integr., VLSI J. 44, 3 (June 2011), 192--204. Google Scholar
Digital Library
- S. Yang, A. Gayasen, C. Mulpuri, S. Reddy, and R. Aggarwal. 2016. Routability-driven FPGA placement contest. In Proceedings of the International Symposium on Physical Design. ACM, 139--143. Google Scholar
Digital Library
- D. Yeager, D. Chiu, and G. Lemieux. 2007. Congestion estimation and localization in FPGAs: A visual tool for interconnect prediction. In Proceedings of the International Workshop on System Level Interconnect Prediction. ACM, 33--40. Google Scholar
Digital Library
- Q. Zhou, X. Wang, Z. Qi, Z. Chen, Q. Zhou, and Y. Cai. 2015. An accurate detailed routing routability prediction model in placement. In Proceedings of the Asia Symposium on Quality Electronic Design (ASQED’15). 119--122.Google Scholar
- Y. Zhuo, H. Li, and S. Mohanty. 2006. A congestion driven placement algorithm for FPGA synthesis. In Proceedings of the International Conference on Field Programmable Logic and Applications. 683--686.Google Scholar
Index Terms
Novel Congestion-estimation and Routability-prediction Methods based on Machine Learning for Modern FPGAs
Recommendations
A Deep Learning Framework to Predict Routability for FPGA Circuit Placement
The ability to accurately and efficiently estimate the routability of a circuit based on its placement is one of the most challenging and difficult tasks in the Field Programmable Gate Array (FPGA) flow. In this article, we present a novel, deep learning ...
Routability Optimization for Industrial Designs at Sub-14nm Process Nodes Using Machine Learning
ISPD '17: Proceedings of the 2017 ACM on International Symposium on Physical DesignDesign rule check (DRC) violations after detailed routing prevent a design from being taped out. To solve this problem, state-of-the-art commercial EDA tools global-route the design to produce a global-route congestion map; this map is used by the ...
Clock-aware ultrascale FPGA placement with machine learning routability prediction
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided DesignAs 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 ...






Comments