Hossein Omidian Savarbaghi
ABSTRACT
FPGA placement and routing are still challenging problems. Given the increased diversity of logic and routing resources on FPGA chips, it seems appropriate to tackle the placement problem as a mapping between the nodes and edges in a circuit graph to compatible resources in the architecture graph. We explore utilizing graph isomorphism algorithms to perform FPGA placement. We use a hierarchical approach in which the circuit and architecture graphs are simultaneously clustered to reduce the size of the search space, and then a novel reductive graph product method is used to solve the isomorphism problem. The graph product algorithm is called reductive as it eliminates a linear number of candidates at every step of the search process, reducing the number of candidate nodes by approximately 1/3. Compared to the annealing-based placement tool VPR 5.0, we achieve approximately 40% improvement in placement runtime, while improving the critical path delay by about 7% and wire length by 5%, while demanding 1.3% more channels on average.
- Jason Luu, Ian Kuon, Peter Jamieson, Ted Campbell, Andy Ye, Wei Mark Fang, Jonathan Rose, VPR 5.0: FPGA cad and architecture exploration tools with single-driver routing, heterogeneity and process scaling, Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays, February 22-24, 2009, Monterey, California, USA. Google Scholar
Digital Library
- Gang Wang, "Ant Colony Metaheuristics for Fundamental Architectural Design Problems", PhD Thesis, University of California Santa Barbara, 2007. Google ScholarDigital Library
- Dai, H., Zhou, Q., Bian, J. N., "Multilevel optimization for large-scale hierarchical FPGA placement", Journal of Computer Science and Technology, 25(5): 1083--1091 Sept. 2010. DOI 10.1007/s11390-010-1085-4. Google ScholarDigital Library
- Cristinel Ababei, "Speeding Up FPGA Placement via Partitioning and Multithreading", International Journal of Reconfigurable Computing, Vol. 2009 (2009). Google ScholarDigital Library
- International Technology Roadmap for Semiconductors (ITRS), http://public.itrs.net/.Google Scholar
- http://www.xilinx.com.Google Scholar
- http://www.altera.com.Google Scholar
- George Karypis and Vipin Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs", International Conference on Parallel Processing, pp. 113--122, 1995.Google Scholar
- J. Cong, M. Xie and Y. Zhang, "An Enhanced Multilevel Routing System," Proc. IEEE International Conference on Computer Aided Design, San Jose, California, pp. 51--58, November 2002. Google ScholarDigital Library
- Amit Singh, Malgorzata Marek-Sadowska, Efficient circuit clustering for area and power reduction in FPGAs, Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays, February 24-26, 2002, Monterey, California, USA. Google ScholarDigital Library
- http://cs.anu.edu.au/~bdm/nauty/.Google Scholar
- G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, 'Multilevel Hypergraph Partitioning: Application in VLSI domain', Proc. ACM/IEEE DAC, June 1997. Google ScholarDigital Library
- Pongstorn Maidee, Cristinel Ababei, and Kia Bazarga, "Timing-driven Partitioning-based Placement for Island Style FPGAs", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), Vol. 24, No. 3, pp. 395--406, Mar. 2005. Google ScholarDigital Library
- S. Ghiasi, E. Bozorgzadeh, S. Choudhuri, M. Sarrafzadeh, A unified theory of timing budget management, Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, p.653--659, November 07-11, 2004 Google ScholarDigital Library
- E. Bozorgzadeh, S. Ghiasi, A. Takahashi, M. Sarrafzadeh, Optimal integer delay budgeting on directed acyclic graphs, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA. Google ScholarDigital Library
Index Terms
- FPGA placement by graph isomorphism (abstract only)
Recommendations
Routability-Driven Blockage-Aware Macro Placement
DAC '14: Proceedings of the 51st Annual Design Automation ConferenceWe 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 ...
An Analytical-based Hybrid Algorithm for FPGA Placement
GLSVLSI '19: Proceedings of the 2019 on Great Lakes Symposium on VLSIAs the capacity of FPGA increases, FPGA placers that adopt Simulated Annealing (SA) algorithm take more and more runtime. To solve this problem, this paper presents HCAS, a Hybrid algorithm Combining Analytical method and SA. There are three ...
Simultaneous placement with clustering and duplication
DAC '04: Proceedings of the 41st annual Design Automation ConferenceClustering, duplication, and placement are critical steps in a cluster-based FPGA design flow. Clustering has a great impact on the wirelength, timing, and routability of a circuit. Logic duplication is an effective method for improving performance ...
Comments