Michael J. Alexander
- 1.M. J. ALEXANDER, J. P. COHOON, J. L. GANLEY, AND G. ROBINS, An Architecture-Independent Approach to FPGA Routing Based on Multi-Weighted Graphs, in Proc. European Design Automation Conf., Grenoble, France, September 1994, pp. 259-264. Google Scholar
Digital Library
- 2.M. J. ALEXANDER AND G. ROBINS, A New Approach to FPGA Routing Based on Multi-Weighted Graphs, in Proc. ACM/SIGDA Intl. Workshop on Field- Programmable Gate Arrays, Berkeley, CA, February 1994.Google Scholar
- 3.S. D. BROWN, R. J. FRANCIS, J. ROSE, AND Z. G. VRANESIC Field-Programmable Gate Arrays, Kluwer Academic 'Publishers, Boston, MA, 1992. Google ScholarDigital Library
- 4.Y.-W. CHANG, S. THAKUR, K. ZHU, AND D. F. WONG, A New Global Routing Algorithm for FPGAs, in Proc. IEEE Intl. Conf. Computer-Aided Design, San Jose, CA, November 1994. Google ScholarDigital Library
- 5.J. GONG, K. S. LEUNG, AND D. ZHOU, Performance- Driven Interconnect Design Based on Distributed R C Delay Model, in Proc. ACM/IEEE Design Automation Conf., Dallas, June 1993, pp. 606-611. Google ScholarDigital Library
- 6.E. W. DIJKSTRA, A Note on Two Problems in Connection With Graphs, Numerische Mathematik, 1 (1959), pp. 269-271.Google ScholarDigital Library
- 7.J. L. GANLEY, private communication, April, 1994.Google Scholar
- 8.J. GRIFFITH, G. ROBINS, J. S. SALOWE, AND T. ZHANG, Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time, IEEE Trans. Computer- Aided Design, 13 (1994), pp. 1351-1365.Google ScholarDigital Library
- 9.F. K. HWANG, D. S. RICHARDS, AND P. WINTER, The Steiner Tree Problem, North-Holland, 1992.Google Scholar
- 10.A. B. KAHNG AND G. ROBINS, A New Class of Iterative Steiner Tree Heuristics With Good Performance, IEEE Trans. Computer-Aided Design, 11 (1992), pp. 893-902.Google ScholarDigital Library
- 11.A. B. KAHNG AND G. ROBINS, On Optimal Interconnections for VLSI, Kluwer Academic Publishers, Boston, MA, 1995.Google Scholar
- 12.L. Kou, G. MARKOWSKY, AND g. BERMAN, A Fast Algorithm for Steiner Trees, Acta Informatica, 15 (1981), pp. 141-145.Google ScholarDigital Library
- 13.G. G. LEMIEUX AND S. D. BROWN, A Detailed Routing Algorithm for Allocating Wire Segments in Field- Programmable Gate Arrays, in Proc. ACM/SIGDA Physical Design Workshop, Lake Arrowhead, CA, April 1993.Google Scholar
- 14.S. K. RAO, P. SADAYAPPAN, F. K. HWANG, AND P. W. SHOR, The Rectilinear Steiner Arborescence Problem, Algorithmica, (1992), pp. 277-288.Google Scholar
- 15.Y. SUN, T. C. WANG, C. K. WONG, AND C. L. LIU, Routing for Symmetric FPGAs and FPICs, in Proc. IEEE Intl. Conf. Computer-Aided Design, Santa Clara, CA, November 1993, pp. 486-490. Google ScholarDigital Library
- 16.S. M. TRIMBERGER, Field-Programmable Gate Array Technology, S. M. Trimberger, editor, Kluwer Academic Publishers, Boston, MA, 1994. Google ScholarDigital Library
- 17.Y.-L. Wu AND D. CHANG, On the NP-Completeness of Regular 2-D FPGA Routing Architectures and a Novel Solution. in Proc. IEEE Intl. Conf. Computer-Aided Design, San Jose, CA, November 1994, pp. 362-366. Google ScholarDigital Library
- 18.Y.-L. Wu AND M. MAREK-SADOWSKA, An Efficient Router for 2-D Field Programmable Gate Arrays, in European Design and Test Conf., 1994, pp. 412-416.Google Scholar
- 19.XILINX, The Programmable Gate Array Data Book, Xilinx, Inc., San Jose, California, 1994.Google Scholar
- 20.A. Z. ZELIKOVSKY, An 11,/6 Approximation Algorithm for the Network Steiner Problem, Algorithmica, 9 (1993), pp. 463-470.Google ScholarCross Ref
Index Terms
- New performance-driven FPGA routing algorithms
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 ...
Performance-driven simultaneous placement and routing for FPGA's
Sequential place and route tools for field programmable gate arrays (FPGA's) are inherently weak at addressing both wirability and timing optimizations. This is primarily due to the difficulty of accurately predicting wirability and delay during ...
New performance-driven FPGA routing algorithms
Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions significantly outperform the best known ones and have provably good performance ...
Comments