An architecture-independent approach to FPGA routing based on multi-weighted graphs
作者： James P. Cohoon , Gabriel Robins , Michael J. Alexander , Joseph L. Ganley
关键词:
摘要: We propose a general framework for FPGA routing, which allows simultaneous optimization of multiple competing objectives under smooth designercontrolled tradeoff. Our approach is based on new multi-weighted graph formulation, enabling theoretical performance characterization, as well practical implementation. router architectureindependent, computationally efficient, and performs industrial benchmarks.
acm.org
sci-hub.st 参考文章(23)
Gabriel Robins, Michael J. Alexander, An Architecture-Independent Unified Approach to FPGA Routing University of Virginia. ,(1993)
Pawel Winter, Dana Scott Richards, Frank Hwang, The Steiner Tree Problem ,(1992)
Michael Randolph Garey, David S. Johnson, The Rectilinear Steiner Problem is NP-Complete Siam Journal on Applied Mathematics. ,(1977)
J.L. Ganley, J.P. Cohoon, Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles international symposium on circuits and systems. ,vol. 1, pp. 113- 116 ,(1994) , 10.1109/ISCAS.1994.408768
Field-Programmable Gate Array Technology Kluwer Academic Publishers. ,(1994) , 10.1007/978-1-4615-2742-8
J.P. Cohoon, D.S. Richards, Optimal two-terminal a-b wire routing Integration. ,vol. 6, pp. 35- 57 ,(1988) , 10.1016/0167-9260(88)90017-X
L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees Acta Informatica. ,vol. 15, pp. 141- 145 ,(1981) , 10.1007/BF00288961
K.-C. Chen, J. Cong, Y. Ding, A.B. Kahng, P. Trajmar, DAG-Map: graph-based FPGA technology mapping for delay optimization IEEE Design & Test of Computers. ,vol. 9, pp. 7- 20 ,(1992) , 10.1109/54.156154
Pak K. Chan, Martine D. F. Schlag, Jason Y. Zien, On routability prediction for field-programmable gate arrays Proceedings of the 30th international on Design automation conference - DAC '93. pp. 326- 330 ,(1993) , 10.1145/157485.164915
Y. F. Wu, P. Widmayer, C. K. Wong, A faster approximation algorithm for the Steiner problem in graphs Acta Informatica. ,vol. 23, pp. 223- 229 ,(1986) , 10.1007/BF00289500