Algorithms for an FPGA switch module routing problem with application to global routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 16, Issue 1, 1997, Pages 32-46

  Thakur, Shashidhar ^a   Chang, Yao Wen ^a   Wong, D F ^a   Muthukrishnan, S ^a  

^a SYNOPSYS INC   (United States)

Author keywords

Field programmable gate array; Global routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; SWITCHES;

FIELD PROGRAMMABLE GATE ARRAYS; GLOBAL ROUTING; INTEGER LINEAR PROGRAMMING;

LOGIC GATES;

EID: 0030649638     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.559330     Document Type: Article

References (21)

1. Optimized Reconfigurable Cell Array (ORCA) Series Field-Programmable Gate Arrays. AT&T Microelectronics, Advance Data Sheet, Feb., 1993.
2. N. Bhat and D. Hill, "Routable technology mapping for LUT FPGA's," Proc. Int. Conf. Computer Design, VLSI Computers Processors, 1992, pp. 95-98.
3. S. Brown, R. J. Francis, J. Rose, and Z. G. Vranesic, Field-Programmable Gate Arrays. Norwell, MA: Kluwer, 1992.
4. S. Brown, J. Rose, and Z. G. Vranesic, "A detailed router for field-programmable gate arrays," IEEE Trans. Computer-Aided Design, vol. 11, pp. 620-627, 1992.
5. Y.-W. Chang, S. Thakur, K. Zhu, and D. F. Wong, "A new global routing algorithm for FPGA's," IEEE/ACM Proc. Int. Conf. Computer-Aided Design, 1994, pp. 380-385.
6. E. Dijkstra, "A note on two problems in connection with graphs," Numer. Math., vol. 1, pp. 269-271, 1959.
7. M. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
8. H.C. Hsieh, W. Carter, J. Ja, E. Cheung, S. Schreifels, C. Erickson, P. Freidin, L. Tinkey, and R. Kanaza, "Third-generation architecture boosts speed and density of field-programmable gate arrays," Proc. IEEE Custom Integrated Circuits Conf., 1990, pp. 31.2.1-31.2.7.
9. T. C. Hu, Integer Programming and Network Flows. Reading, MA: Addison-Wesley, 1969.
10. K. Kawana, H. Keida, M. Sakamoto, K. Shibata, and I. Moriyama, "An efficient logic block interconnect architecture for user-reprogrammable gate array," Proc. IEEE Custom Integrated Circuits Conf., 1990, pp. 31.3.1-31.3.4
11. E. S. Kuh and M. Marek-Sadowska, "Global routing," Layout Design and Verification, T. Ohtsuki, Ed. Amsterdam, The Netherlands: Elsevier, 1985.
12. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization-Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
13. M. J. Lorenzetti and D. S. Baeder, "Routing," Physical Design Automation of VLSI System, B. Preas and M. J. Lorenzetti, Eds. Menlo Park, CA: Benjamin-Cummings, 1988.
14. G. Lemieux and S. Brown, "A detailed routing algorithm for allocating wire segments in field-programmable gate arrays," Proc. ACM/SIGDA Physical Design Workshop, Lake Arrowhead, CA, 1993, pp. 215-226.
15. J. Rose and S. Brown, "Flexibility of interconnection structures for field-programmable gate arrays," IEEE J. Solid State Circuits, vol. 26, no. 3, pp. 277-282, 1991.
16. D. D. Sleator and R. E. Tarjan, "A data structure for dynamic trees," J. Comput. Syst. Sci., vol. 26, pp. 362-391, 1983.
17. S. Thakur, D. F. Wong, and S. Muthukrishnan, "Algorithms for FPGA switch module routing," Proc. European Design Automation Conf., 1994, pp. 265-270.
18. S. Trimberger, Ed., Field-Programmable Gate Array Technology. Norwell, MA: Kluwer, 1994.
19. S. Trimberger and M. Chene, "Placement-based partitioning for lookup-table-based FPGA's," Proc. Int. Conf. Computer Design, VLSI Computers Processors, 1992, pp. 91-94.
20. The Programmable Logic Data Book, Xilinx Inc., 1994.
21. K. Zhu, D. F. Wong, and Y.-W. Chang, "Switch module design with application to two-dimensional segmentation design," Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1993, pp. 481-486