ABSTRACT
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused by long wiring paths that avoid congestion or a failure to route all signals. This paper presents PathFinder, a router that balances the goals of performance and routability. PathFinder uses an iterative algorithm that converges to a solution in which all signals are routed while achieving close to the optimal performance allowed by the placement. Routability is achieved by forcing signals to negotiate for a resource and thereby determine which signal needs the resource most. Delay is minimized by allowing the more critical signals a greater say in this negotiation. Because PathFinder requires only a directed graph to describe the architecture of routing resources, it adapts readily to a wide variety of FPGA architectures such as Triptych, Xilinx 3000 and mesh-connected arrays of FPGAs. The results of routing ISCAS benchmarks on the Triptych FPGA architecture show an average increase of only 4.5% in critical path delay over the optimum delay for a placement. Routes of ISCAS benchmarks on the Xilinx 3000 architecture show a greater completion rate than commercial tools, as well as 11% faster implementations.
- Alexander94.M. Alexander, "A Unified New Approach to FPGA Routing Based on Multi-Weighted Graphs," 2rid International ACM/SIGDA Workshop on Field- Programmable Gate Arrays, February 1994.Google Scholar
- Brown92.S. Brown, J. Rose, and Z. Vranesic, "A Detailed Router for Field-Programmable Gate Arrays," IEEE Transactions on Computer-Aided Design, vol. 11, no. 5, May 1992, pp. 620-628.Google ScholarDigital Library
- Cohn91.J. Cohn, D. Garrod, R. Rutenbar, and L. Carley, "KOAN/ANAGRAM II: New Tools for Device- Level Analog Placement and Routing," IEEE Journal of Solid-State Circuits, vol. 26, March 1991, pp. 330-342.Google ScholarCross Ref
- Dees81.W. Dees and R. Smith, "Performance of Interconnection Rip-Up and Reroute Strategies," in Prec. 18th Design Automation Conference, June 1981, pp. 382-390. Google ScholarDigital Library
- Frankle92.J. Frankle, "Iterative and Adaptive Slack Allocation for Performance-driven Layout and FPGA Routing," in Prec. 29h Design Automation Conference, June 1992, pp. 536-542. Google ScholarDigital Library
- Hauck92.S. Hauck, G. Borriello and C. Ebeling, "TRIPTYCH: An FPGA Architecture with Integrated Logic and Routing," in Prec. of the 1992 Conference on Advanced Research in VLSI and Parallel Systems, March 1992, pp. 26-43.Google Scholar
- Hill91.D. Hill, "A CAD System for the Design of Field Programmable Gate Arrays," in Prec. 28th Design Automation Conference, June 1991, pp. 187-192. Google ScholarDigital Library
- Linsker84.R. Linsker, "An Iterative-Improvement Penalty-Function-Driven Wire Routing System," IBM Journal of Research and Development, vol. 28, Sept. 1984, pp. 613-624. Google ScholarDigital Library
- Nair87.R. Nair, "A Simple Yet Effective Technique for Global Wiring," IEEE Transactions on Computer- Aided Design, vol. CAD-6, no. 6, March 1987, pp. 165-172.Google Scholar
- Takahashi80.H. Takahashi and A. Matsuyama, "An Approximate Solution for the Problem in Graphs," Japonica, vol. 24, 1980, pp. 573-577.Google Scholar
- Xilinx93.Xilinx, Inc., Xact Development System, 1993.Google Scholar
Index Terms
- PathFinder: a negotiation-based performance-driven router for FPGAs
Recommendations
Revisiting PathFinder Routing Algorithm
FPGA '22: Proceedings of the 2022 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysPathFinder, a popular routing algorithm widely used in the state-of-the-art FPGA compilation tools such as VTR 8, has been reported to have a non-negligible variation in the routing quality under routing resource constraints. Several workaround methods ...
Timing-driven pathfinder pathology and remediation: quantifying and reducing delay noise in VPR-pathfinder
FPGA '11: Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arraysWe show that, with the VPR implementation of Pathfinder, perturbations of initial conditions may cause critical paths to vary over ranges of 17-110%. We further show that it is not uncommon for VPR/Pathfinder to settle for solutions that are >33% slower ...
Pathfinder based on simulated annealing for solving placement and routing problem
ISICA'10: Proceedings of the 5th international conference on Advances in computation and intelligenceThe placement and routing is a hot topic in Evolvable Hardware, the work of the placement and routing in this paper is as follows: (1) Combining with FPGA's and the VPR's "placement and routing" two-stage optimization model, the designed "random ...
Comments