skip to main content
research-article

A Runtime FPGA Placement and Routing Using Low-Complexity Graph Traversal

Published:17 March 2015Publication History
Skip Abstract Section

Abstract

Dynamic Partial Reconfiguration (DPaR) enables efficient allocation of logic resources by adding new functionalities or by sharing and/or multiplexing resources over time. Placement and routing (P&R) is one of the most time-consuming steps in the DPaR flow. P&R are two independent NP-complete problems, and, even for medium size circuits, traditional P&R algorithms are not capable of placing and routing hardware modules at runtime. We propose a novel runtime P&R algorithm for Field-Programmable Gate Array (FPGA)-based designs. Our algorithm models the FPGA as an implicit graph with a direct correspondence to the target FPGA. The P&R is performed as a graph mapping problem by exploring the node locality during a depth-first traversal. We perform the P&R using a greedy heuristic that executes in polynomial time. Unlike state-of-the-art algorithms, our approach does not try similar solutions, thus allowing the P&R to execute in milliseconds. Our algorithm is also suitable for P&R in fragmented regions. We generate results for a manufacturer-independent virtual FPGA. Compared with the most popular P&R tool running the same benchmark suite, our algorithm is up to three orders of magnitude faster.

References

  1. V. Betz and J. Rose. 1997. VPR: A new packing, placement and routing tool for FPGA research. In International Conference on Field Programmable Logic and Applications (FPL’97). Springer-Verlag, Berlin, 213--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Dehyadgari, M. Nickray, A. Afzali-Kusha, and Z. Navabi. 2005. Evaluation of pseudo adaptive XY routing using an object oriented model for NOC. In International Conference on Microelectronics. IEEE, 204--208.Google ScholarGoogle Scholar
  3. W. E. Donath. 1980. Complexity theory and design automation. In Design Automation Conference. ACM, New York, NY, 412--419. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Ferreira, A. Garcia, T. Teixeira, and J. M. P. Cardoso. 2007. A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures. In ISVLSI. IEEE, 61--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. G. Gericota, G. R. Alves, M. L. Silva, and J. M. Ferreira. 2003. Run-time management of logic resources on reconfigurable systems. In Design, Automation and Test Conference (DATE’03). ACM/IEEE, 974--979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Gort and J. H. Anderson. 2011. Reducing FPGA router run-time through algorithm and architecture. In International Conference on Field Programmable Logic and Applications (FPL’11). IEEE, 336--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Handa and R. Vemuri. 2004. An efficient algorithm for finding empty space for online FPGA placement. In Design Automation Conference (DAC’04). ACM/IEEE, 960--965. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Hübner, P. Figuli, R. Girardey, D. Soudris, K. Siozios, and J. Becker. 2011. A heterogeneous multicore system on chip with run-time reconfigurable virtual FPGA architecture. In Workshops and PhD Forum (IPDPSW). IEEE, 143--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Lin and J. Wawrzynek. 2010. Improving FPGA placement with dynamically adaptive stochastic tunneling. IEEE Transactions on CAD of Integrated Circuits and Systems 29, 12 (2010), 1858--1869. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. T. Lin, P. Banerjee, and Y. Chang. 2013. An efficient and effective analytical placer for FPGAs. In Design Automation Conference (DAC’13). ACM/IEEE, Article 10, 6 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. X. Lin, P. K. McKinley, and L. M. Ni. 1994. Deadlock-free multicast wormhole routing in 2-D mesh multicomputers. IEEE Transactioins on Parallel and Distributed Systems 5 (1994), 793--804. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Ludwin and V. Betz. 2011. Efficient and deterministic parallel placement for FPGAs. ACM Transactions on Design Automation of Electronic Systems 16, 3, Article 22 (2011), 23 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Luu, I. Kuon, P. Jamieson, T. Campbell, A. Ye, W. M. Fang, K. Kent, and J. Rose. 2011. VPR 5.0: FPGA CAD and architecture exploration tools with single-driver routing, heterogeneity and process scaling. ACM Transactions on Reconfigurable Technology and Systems 4, 4, Article 32 (Dec. 2011), 23 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Maidee, C. Ababei, and K. Bazargan. 2005. Timing-driven partitioning-based placement for island style FPGAs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24, 3 (2005), 395--406. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. MCNC. 2010. BLIF Benchmark Suit. Retrieved from http://cadlab.cs.ucla.edu/∼kirill/.Google ScholarGoogle Scholar
  16. K. Papadimitriou, A. Dollas, and S. Hauck. 2011. Performance of partial reconfiguration in FPGA systems: A survey and a cost model. ACM Transactions on Reconfigurable Technology and Systems (TRETS) 4, 4 (2011), 36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. H. Sidiropoulos, K. Siozios, P. Figuli, D. Soudris, and M. Hubner. 2012. On supporting efficient partial reconfiguration with just-in-time compilation. In PhD Forum (IPDPSW), IEEE. IEEE, 328--335. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Sidiropoulos, K. Siozios, P. Figuli, D. Soudris, M. Hübner, and J. Becker. 2013. JITPR: A framework for supporting fast application’s implementation onto FPGAs. ACM Transactions on Reconfigurable Technology and Systems 6, 2, Article 7 (Aug. 2013), 12 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Steven J. E. Wilton. 1997. Architectures and Algorithms for Field-Programmable Gate Arrays with Embedded Memory. Ph.D. Dissertation. University of Toronto. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Q. Wu and K. S. McElvain. 2012. A fast discrete placement algorithm for FPGAs. In Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA’12). ACM, New York, NY, 115--118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Xu, G. Grewal, and S. Areibi. 2011. Starplace: A new analytic method for FPGA placement. Integration, the VLSI Journal 44, 3 (2011), 192--204. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Runtime FPGA Placement and Routing Using Low-Complexity Graph Traversal

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Reconfigurable Technology and Systems
        ACM Transactions on Reconfigurable Technology and Systems  Volume 8, Issue 2
        Special Section on FPL 2013
        April 2015
        129 pages
        ISSN:1936-7406
        EISSN:1936-7414
        DOI:10.1145/2746532
        • Editor:
        • Steve Wilton
        Issue’s Table of Contents

        Copyright © 2015 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 17 March 2015
        • Revised: 1 July 2014
        • Accepted: 1 July 2014
        • Received: 1 December 2013
        Published in trets Volume 8, Issue 2

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed
      • Article Metrics

        • Downloads (Last 12 months)7
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!