ACM Home Page
Please provide us with feedback. Feedback
PathFinder: a negotiation-based performance-driven router for FPGAs
Full text PdfPdf (76 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays table of contents
Monterey, California, United States
Pages: 111 - 117  
Year of Publication: 1995
ISBN:0-89791-743-X
Authors
Larry McMurchie  Dept. of Computer Science and Engineering, University of Washington, Seattle, WA
Carl Ebeling  Dept. of Computer Science and Engineering, University of Washington, Seattle, WA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 62,   Citation Count: 79
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/201310.201328
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
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.
 
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.
 
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.
 
Dees81
 
Frankle92
 
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.
Hill91
 
Linsker84
 
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.
 
Takahashi80
H. Takahashi and A. Matsuyama, "An Approximate Solution for the Problem in Graphs," Japonica, vol. 24, 1980, pp. 573-577.
 
Xilinx93
Xilinx, Inc., Xact Development System, 1993.

CITED BY  79
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Larry McMurchie: colleagues
Carl Ebeling: colleagues

Peer to Peer - Readers of this Article have also read: