PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs
暂无分享,去创建一个
[1] Mikael Palczewski. Plane parallel A* maze router and its application to FPGAs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[2] Carl Ebeling,et al. Placement and routing tools for the Triptych FPGA , 1995, IEEE Trans. Very Large Scale Integr. Syst..
[3] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[4] Dwight D. Hill,et al. A CAD system for the design of field programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.
[5] Ralph Linsker,et al. An Iterative-Improvement Penalty-Function-Driven Wire Routing System , 1984, IBM J. Res. Dev..
[6] Joseph L. Ganley,et al. An architecture-independent approach to FPGA routing based on multi-weighted graphs , 1994, EURO-DAC '94.
[7] Robert J. Smith,et al. Performance of Interconnection Rip-Up and Reroute Strategies , 1981, 18th Design Automation Conference.
[8] Jonathan Rose,et al. A detailed router for field-programmable gate arrays , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[9] Carl Ebeling,et al. The Triptych FPGA architecture , 1995, IEEE Trans. Very Large Scale Integr. Syst..
[10] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..
[11] Carl Ebeling,et al. TRIPTYCH: An FPGA Architecture with Integrated Logic and Routing , 1992 .
[12] Jon Frankle,et al. Iterative and adaptive slack allocation for performance-driven layout and FPGA routing , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[13] Ravi Nair,et al. A Simple Yet Effective Technique for Global Wiring , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[14] Rob A. Rutenbar,et al. KOAN/ANAGRAM II: new tools for device-level analog placement and routing , 1991 .
[15] Larry McMurchie,et al. Emerald - An Architecture-Driven Tool Compiler for FPGAs , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.
[16] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.