research-article

Simultaneous Placement and Clock Tree Construction for Modern FPGAs

Authors:

Mehrdad E. Dehkordi,

David Z. PanAuthors Info & Claims

FPGA '19: Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

Pages 132 - 141

https://doi.org/10.1145/3289602.3293897

Published: 20 February 2019 Publication History

Abstract

Modern field-programmable gate array (FPGA) devices often contain complex clocking architectures to achieve high-performance and flexible clock networks. The physical structure of these clock networks, however, are pre-manufactured, unadjustable, and with only limited routing resources. Most conventional FPGA placement algorithms rarely consider clock feasibility, and therefore lead to clock routing failures. Some recent works adopt simplified clock routing models (e.g., the bounding box model) to force clock legality during placement, which, however, can often overestimate clock routing demands and results in unnecessary placement quality degradation. To address these limitations, in this paper, we propose a generic FPGA placement framework that can simultaneously optimize placement quality and ensure clock feasibility by explicit clock tree construction. We demonstrate the effectiveness and efficiency of the proposed approach using the ISPD 2017 Clock-Aware Placement Contest benchmark suite. Compared with other state-of-the-art clock legalization algorithms, the proposed approach can achieve the best routed wirelength with competitive runtime.

References

[1]

Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications .Prentice-Hall, Inc.

Digital Library

[2]

Vaughn Betz and Jonathan Rose. 1997. VPR: A new packing, placement and routing tool for FPGA research. In FPL. 213--222.

Digital Library

[3]

Yu-Chen Chen, Sheng-Yen Chen, and Yao-Wen Chang. 2014. Efficient and effective packing and analytical placement for large-scale heterogeneous FPGAs. In ICCAD. 647--654.

Digital Library

[4]

Marshall L Fisher. 1981. The Lagrangian relaxation method for solving integer programming problems. Management science, Vol. 27, 1 (1981), 1--18.

Digital Library

[5]

Xilinx UltraScale Architecture Clocking Resources User Guide. 2018. https://www.xilinx.com/support/documentation/user_guides/ug572-ultrascale-clocking.pdf .

[6]

Peter E Hart, Nils J Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, Vol. 4, 2 (1968), 100--107.

[7]

Xilinx Inc. 2018. http://www.xilinx.com .

[8]

Myung-Chul Kim, Dong-Jin Lee, and Igor L. Markov. 2012. SimPL: An Effective Placement Algorithm. IEEE TCAD, Vol. 31, 1 (2012), 50--60.

Digital Library

[9]

Yun-Chih Kuo, Chau-Chin Huang, Shih-Chun Chen, Chun-Han Chiang, Yao-Wen Chang, and Sy-Yen Kuo. 2017. Clock-aware placement for large-scale heterogeneous FPGAs. In ICCAD. 519--526.

Digital Library

[10]

Julien Lamoureux and Steven J. E. Wilton. 2008. On the Trade-off between power and flexibility of FPGA clock networks. ACM Transactions on Reconfigurable Technology and Systems (TRETS), Vol. 1, 3 (2008), 13:1--13:33.

Digital Library

[11]

Eugene L Lawler and David E Wood. 1966. Branch-and-bound methods: A survey. Operations research, Vol. 14, 4 (1966), 699--719.

Digital Library

[12]

Wuxi Li, Shounak Dhar, and David Z. Pan. 2018. UTPlaceF: A routability-driven FPGA placer with physical and congestion aware packing. IEEE TCAD, Vol. 37, 4 (2018), 869--882.

Digital Library

[13]

Wuxi Li, Meng Li, Jiajun Wang, and David Z. Pan. 2017. UTPlaceF 3.0: A parallelization framework for modern FPGA global placement. In ICCAD . 908--914.

Digital Library

[14]

Wuxi Li, Yibo Lin, Meng Li, Shounak Dhar, and David Z Pan. 2018. UTPlaceF 2.0: A high-performance clock-aware FPGA placement engine. ACM TODAES, Vol. 23, 4 (2018), 42.

Digital Library

[15]

Wuxi Li and David Z. Pan. 2018. A new paradigm for FPGA placement without explicit packing. IEEE TCAD (2018).

[16]

Tzu-Hen Lin, Pritha Banerjee, and Yao-Wen Chang. 2013. An efficient and effective analytical placer for FPGAs. In DAC. 10:1--10:6.

Digital Library

[17]

Wen-Hao Liu, Yih-Lang Li, and Cheng-Kok Koh. 2012. A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing. In ICCAD . 713--719.

Digital Library

[18]

Alexander S. Marquardt, Vaughn Betz, and Jonathan Rose. 1999. Using cluster-based logic blocks and timing-driven packing to improve FPGA speed and density. In FPGA. 37--46.

Digital Library

[19]

Ryan Pattison, Ziad Abuowaimer, Shawki Areibi, Gary Gréwal, and Anthony Vannelli. 2016. GPlace: A congestion-aware placement tool for ultrascale FPGAs. In ICCAD . 68:1--68:7.

Digital Library

[20]

Chak-Wa Pui, Gengjie Chen, Wing-Kai Chow, Ka-Chun Lam, Jian Kuang, Peishan Tu, Hang Zhang, Evangeline F.Y. Young, and Bei Yu. 2016. RippleFPGA: A routability-driven placement for large-scale heterogeneous FPGAs. In ICCAD . 67:1--67:8.

Digital Library

[21]

Chak-Wa Pui, Gengjie Chen, Yuzhe Ma, Evangeline F. Y. Young, and Bei Yu. 2017. Clock-aware ultraScale FPGA placement with machine learning routability prediction. In ICCAD . 915--922.

Digital Library

[22]

Senthilkumar Thoravi Rajavel and Ali Akoglu. 2011. MO-Pack: Many-objective clustering for FPGA CAD. DAC. 818--823.

Digital Library

[23]

Amit Singh, Ganapathy Parthasarathy, and Malgorzata Marek-Sadowska. 2002. Efficient circuit clustering for area and power reduction in FPGAs. ACM TODAES, Vol. 7, 4 (2002), 643--663.

Digital Library

[24]

Love Singhal, Mahesh A. Iyer, and Saurabh Adya. 2017. LSC: A large-scale consensus-based clustering algorithm for high-performance FPGAs. In DAC . 30:1--30:6.

Digital Library

[25]

Xilinx Vivado Design Suite. 2018. https://www.xilinx.com/products/design-tools/vivado.html .

[26]

M Xu, Gary Gréwal, and Shawki Areibi. 2011. StarPlace: A new analytic method for FPGA placement. Integration, the VLSI Journal, Vol. 44, 3 (2011), 192--204.

Digital Library

[27]

Stephen Yang, Aman Gayasen, Chandra Mulpuri, Sainath Reddy, and Rajat Aggarwal. 2016. Routability-driven FPGA placement contest. In ISPD. 139--143.

Digital Library

[28]

Stephen Yang, Chandra Mulpuri, Sainath Reddy, Meghraj Kalase, Srinivasan Dasasathyan, Mehrdad E. Dehkordi, Marvin Tom, and Rajat Aggarwal. 2017. Clock-aware FPGA placement contest. In ISPD. 159--164.

Digital Library

Cited By

Zhang BZhen LWang SYang F(2024)Integrating Operations Research into Very Large-Scale Integrated Circuits Placement Design: A ReviewAsia-Pacific Journal of Operational Research10.1142/S021759592450007641:06Online publication date: 6-Jul-2024
https://doi.org/10.1142/S0217595924500076
Di ZTao RMai JChen LLin Y(2024)LEAPS: Topological-Layout-Adaptable Multi-Die FPGA Placement for Super Long Line MinimizationIEEE Transactions on Circuits and Systems I: Regular Papers10.1109/TCSI.2023.334055471:3(1259-1272)Online publication date: Mar-2024
https://doi.org/10.1109/TCSI.2023.3340554
Zhu ZMei YDeng KHe HChen JYang JChang Y(2024)High-Performance Placement Engine for Modern Large-Scale FPGAs With Heterogeneity and Clock ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.332977443:3(956-969)Online publication date: Mar-2024
https://doi.org/10.1109/TCAD.2023.3329774
Show More Cited By

Index Terms

Simultaneous Placement and Clock Tree Construction for Modern FPGAs
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
      1. Clock-network synthesis
      2. Placement

Recommendations

Routing-architecture-aware analytical placement for heterogeneous FPGAs
DAC '15: Proceedings of the 52nd Annual Design Automation Conference

Placement is a crucial stage for FPGA implementation. Most FPGA placers optimize their placement results by minimizing half-perimeter wirelength (HPWL). Due to the segmented routing architecture in FPGAs, however, the HPWL function cannot model routed ...
Routability-Driven Blockage-Aware Macro Placement
DAC '14: Proceedings of the 51st Annual Design Automation Conference

We present a new floorplan representation, called circular-packing trees (CP-trees), for the problem of macro placement. Our CP-trees can flexibly pack movable macros toward corners or pre-placed macros along chip boundaries circularly to optimize macro ...
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs

In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

FPGA '19: Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

February 2019

360 pages

ISBN:9781450361378

DOI:10.1145/3289602

General Chair:
Kia Bazargan
Univ. of Minnesota, USA
,
Program Chair:
Stephen Neuendorffer
Xilinx, USA

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 February 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

FPGA '19

Sponsor:

SIGDA

FPGA '19: The 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

February 24 - 26, 2019

CA, Seaside, USA

Acceptance Rates

Overall Acceptance Rate 125 of 627 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
436
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang BZhen LWang SYang F(2024)Integrating Operations Research into Very Large-Scale Integrated Circuits Placement Design: A ReviewAsia-Pacific Journal of Operational Research10.1142/S021759592450007641:06Online publication date: 6-Jul-2024
https://doi.org/10.1142/S0217595924500076
Di ZTao RMai JChen LLin Y(2024)LEAPS: Topological-Layout-Adaptable Multi-Die FPGA Placement for Super Long Line MinimizationIEEE Transactions on Circuits and Systems I: Regular Papers10.1109/TCSI.2023.334055471:3(1259-1272)Online publication date: Mar-2024
https://doi.org/10.1109/TCSI.2023.3340554
Zhu ZMei YDeng KHe HChen JYang JChang Y(2024)High-Performance Placement Engine for Modern Large-Scale FPGAs With Heterogeneity and Clock ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.332977443:3(956-969)Online publication date: Mar-2024
https://doi.org/10.1109/TCAD.2023.3329774
Mai JWang JDi ZLin Y(2024)Multielectrostatic FPGA Placement Considering SLICEL–SLICEM Heterogeneity, Clock Feasibility, and Timing OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.331310143:2(641-653)Online publication date: Feb-2024
https://doi.org/10.1109/TCAD.2023.3313101
Kariotis KDadaliaris AKranas GDimitriou GDossis M(2024)Current Status of Analytical FPGA Placement2024 9th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM63478.2024.00015(30-35)Online publication date: 20-Sep-2024
https://doi.org/10.1109/SEEDA-CECNSM63478.2024.00015
Mai JWang JChen YGuo ZJiang XLiang YLin Y(2024)OpenPARF 3.0: Robust Multi-Electrostatics Based FPGA Macro Placement Considering Cascaded Macros Groups and Fence Regions2024 2nd International Symposium of Electronics Design Automation (ISEDA)10.1109/ISEDA62518.2024.10617535(374-379)Online publication date: 10-May-2024
https://doi.org/10.1109/ISEDA62518.2024.10617535
Zapletina MGavrilov S(2023)Pathfinder Algorithm Modification for FPGA Routing StageRussian Microelectronics10.1134/S106373972207012551:7(573-578)Online publication date: 9-Jan-2023
https://doi.org/10.1134/S1063739722070125
Mai JWang JDi ZLuo GLiang YLin Y(2023)OpenPARF: An Open-Source Placement and Routing Framework for Large-Scale Heterogeneous FPGAs with Deep Learning Toolkit2023 IEEE 15th International Conference on ASIC (ASICON)10.1109/ASICON58565.2023.10396248(1-4)Online publication date: 24-Oct-2023
https://doi.org/10.1109/ASICON58565.2023.10396248
Beheshti-Shirazi SNazari NGubbi KLatibari BRafatirad SHomayoun HSasan AManoj P(2023)Advanced Reinforcement Learning Solution for Clock Skew Engineering: Modified Q-Table Update Technique for Peak Current and IR Drop MinimizationIEEE Access10.1109/ACCESS.2023.330453411(87869-87886)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3304534
Zhu ZMei YLi ZLin JChen JYang JChang YOshana R(2022)High-performance placement for large-scale heterogeneous FPGAs with clock constraintsProceedings of the 59th ACM/IEEE Design Automation Conference10.1145/3489517.3530567(643-648)Online publication date: 10-Jul-2022
https://dl.acm.org/doi/10.1145/3489517.3530567
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten