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.
- 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 Scholar
Digital Library
- 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 Scholar
- W. E. Donath. 1980. Complexity theory and design automation. In Design Automation Conference. ACM, New York, NY, 412--419. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- MCNC. 2010. BLIF Benchmark Suit. Retrieved from http://cadlab.cs.ucla.edu/∼kirill/.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Steven J. E. Wilton. 1997. Architectures and Algorithms for Field-Programmable Gate Arrays with Embedded Memory. Ph.D. Dissertation. University of Toronto. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Index Terms
A Runtime FPGA Placement and Routing Using Low-Complexity Graph Traversal
Recommendations
Dynamic FPGA routing for just-in-time FPGA compilation
DAC '04: Proceedings of the 41st annual Design Automation ConferenceJust-in-time (JIT) compilation has previously been used in many applications to enable standard software binaries to execute on different underlying processor architectures. However, embedded systems increasingly incorporate Field Programmable Gate ...
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
FCCM '05: Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing MachinesJust-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously introduced the concept of a standard hardware binary, using a just-in-time ...
Routing-architecture-aware analytical placement for heterogeneous FPGAs
DAC '15: Proceedings of the 52nd Annual Design Automation ConferencePlacement 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 ...






Comments