An enhanced multilevel routing system

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2002, Pages 51-53

  Cong, Jason ^a   Xie, Min ^a   Zhang, Yan ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENHANCED MULTILEVEL ROUTING SYSTEM; RESOURCE RESERVATION;

ALGORITHMS; FIELD PROGRAMMABLE GATE ARRAYS; INTEGER PROGRAMMING; OPTIMIZATION; RESOURCE ALLOCATION; TREES (MATHEMATICS);

ROUTERS;

EID: 0036907173     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774572.774580     Document Type: Conference Paper

References (25)

1. S. Akers, "A modification of Lee's path connection algorithm," IEEE Trans. on Computers, vol. EC-16, pp. 97-98, Feb. 1967.
2. J. Soukup, "Fast maze router," Proc. 15th Design Automation Conference, pp. 100-102, 1978
3. K. Mikami and K. Tabuchi, "A computer program for optimal routing of printed circuit connectors," IFIPs Proc, vol. H-47, pp.1475-1478, 1968.
4. D. Hightower, "A solution to line routing problems on the continuous plane," Proc. IEEE 6th Design Automation workshop, pp. 1-24, 1969.
5. R. Nair., "A simple yet effective technique for global wiring," IEEE Trans. on Computer-Aided Design, CAD-6(2), 1987.
6. L. McMurchie and C.Ebeling, "Pathfinder: a negotiation-based performance-driven router for FPGAs", Proc. of 3rd International ACM/SIGDA Symposium on Field-Programmable Gate Arrays, Feb. 1995, pp.111-117.
7. R. Carden, J. Li, and C.-K.Cheng, "A global router with a theoretical bound on the optimal solution," IEEE Trans. Computer-Aided Design, vol.15, pp. 208-216, Feb. 1996
8. C.Albrecht, "Provably good global routing by a new approximation algorithm for multicommodity flow," Proc. International Symposium on Physical Design, pp. 19-25, Mar. 2000.
9. J. Cong and P. Madden, "Performance driven multi-layer general area routing for PCB/MCM designs," Proc. 35th Design Automation Conference, pp. 356-361, Jun. 1998.
10. J. Cong, L. He, C.-K. Koh, and P. Madden, "Performance optimization of VLSI interconnect layout," Integration, the VLSI journal, vol.21, no. 1-2, pp. 1-94, 1996
11. C. Chang and J. Cong, "Pseudo pin assignment with crosstalk noise control," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.20, pp. 598-611, Mar. 2001.
12. J. Cong, J. Fang, K. Khoo, "DUNE: A multi-layer gridless routing system with wire planning," Proc. International Symposium on Physical Design, pp. 12-18, Apr. 2000
13. M. Burstein and R. Pelavin, "Hierarchical channel router," Proc. of 20th Design Automation Conference, pages 519-597, 1983.
14. J. Heisterman and T. Lengauer, "The efficient solution of integer programs for hierarchical global routing," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.10,pp. 748-753, Jun. 1991.
15. D. wang and E. Kuh, "A new timing driven multiplayer MCM/IC routing algorithm," Proc. IEEE Multi-Chip module Conference, pp. 89-94, Feb. 1997.
16. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: Applications in VLSI domain," IEEE Trans. on Very large Scale Integration Systems, vol. 7, pp.69-79, Mar. 1999
17. J. Cong, S. Lim, and C. Wu, "Performance driven multilevel and multiway partitioning with retiming," Proc. 37th Design Automation Conference, pp. 274-279, Jun. 2000.
18. T. Chan, J. Cong, T. Kong, and J. Shinnerl, "Multilevel optimization for large-scale circuit placement," Proc. IEEE International Conference on Computer Aided Design, pp. 171-176, Nov. 2000.
19. J. Cong, J. Fang and Y. Zhang, "Multilevel Approach to Full-Chip Gridless Routing," Proc. IEEE International Conference on Computer Aided Design, San Jose, California, pp. 396-403, Nov. 2001
20. C. Chiang, M. Sarrafzadeh, and C.K, Wong, "A powerful global router: Based on Steiner min-max trees," Proc. IEEE International Conference on Computer-Aided Design, pp. 2-5, Nov. 1989.
21. C. Chiang, M. Sarrafzadeh, and C.K., Wong, "A weighted-Steiner-tree-based global router," Manuscript, 1992.
22. J. Cong, A. B. Kahng and K.-S. Leung, "Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.17, no. 1, pp. 24-39, Jan. 1999
23. J. Cong, J. Fang, K. Khoo, "An implicit connection graph maze routing algorithm for ECO routing," Proc. International Conference on Computer Aided Design, pp. 163-167, Nov. 1999.
24. M. Borah, R. M. Owens, M. J., Irwin, "An edge-based heuristic for Steiner routing," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.13, (no.12), Dec. 1994. p.1563-8
25. J. Griffith, G. Robins, J. S. Salowe, Tongtong Zhang, "Closing the gap: near-optimal Steiner trees in polynomial time," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.13, (no.11), Nov. 1994, p.1351-65