Non-hanan routing

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

Volumn 18, Issue 4, 1999, Pages 436-444

  Hou, Huibo ^a,b,c   Hu, Jiang ^a,b,c   Sapatnekar, Sachin S ^a,b,c  

^a IOWA STATE UNIVERSITY   (United States)

^b QUALCOMM INC   (United States)

^c University of Minnesota   (United States)

Author keywords

Global routing; Interconnect; Optimization; Performance optimization; Physical design; Routing; Very large scale integration (vlsi)

Indexed keywords

EID: 33748184441     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.752927     Document Type: Article

References (19)

1. K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins, "Fidelity and near-optimality of Elmore-based routing constructions," in Proc. IEEE Int. Conf. Computer Design, 1993, pp. 81-84.
2. "Rectilinear Steiner trees with minimum Elmore delay," in Proc. ACM/IEEE Design Automat. Conf., 1994, pp. 381-386.
3. "Near-optimal critical sink routing tree constructions," IEEE Trans. Computer-Aided Design, vol. 14, pp. 1417-1436, Dec. 1995.
4. J. Cong and C. K. Koh, "Interconnect layout optimization under higher- order RLC model," in Proc. IEEE Int. Conf. Computer Design, 1997, pp. 713-719.
5. J. Cong, K. S. Leung, and D. Zhou, "Performance-driven interconnect design based on distributed RC delay model," in Proc. ACM/IEEE Design Automat. Conf., 1993, pp. 606-611
6. J. Cong, L. He, C. K. Koh, and P. H. Madden, "Performance optimiza-tion of VLSI interconnect layout," Integration: The VLSI J., vol. 21, pp. 1-94, Nov. 1996.
7. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, pp. 255-265, 1966.
8. N. Hasan, G. Vijayan, and C. K. Wong, "A neighborhood improvement algorithm for rectilinear Steiner trees," in Proc. IEEE Int. Symp. Circuits Syst., 1990, pp. 2869-2872.
9. J. Ho, G. Vijayan, and C. K. Wong, "Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree," in Proc. IEEE Int. Conf. Computer Design, 1989, pp. 6-9.
10. "New algorithms for the rectilinear Steiner tree problem," IEEE Trans. Computer-Aided Design, vol. 9, pp. 185-193, Feb. 1990.
11. F. K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM J. Appl. Math., vol. 30, pp. 104-114, Jan. 1976.
12. "An O(nlogn) algorithm for suboptimal rectilinear Steiner tree," IEEE Trans. Circuits Syst., vol. CAS-26, pp. 75-77, Jan. 1979.
13. A. Kahng and G. Robins, "A new class of iterative Steiner tree heuristics with good performance," IEEE Trans. Computer-Aided Design, vol. 11, pp. 893-902, July 1992.
14. On Optimal Interconnections for VLSI. Norwell, MA: Kluwer Academic, 1995.
15. M. Kang, W. W.-M. Dai, T. Dillinger, and D. LaPotin, "Delay bounded buffered tree construction for timing-driven floorplanning," in Proc. IEEE Int. Conf. Computer Design, 1997, pp. 707-712.
16. J. H. Lee, N. K. Bose, and F. K. Hwang, "Use of Steiner's problem in suboptimal routing in rectilinear metric," IEEE Trans. Circuits Syst., vol. CAS-23, pp. 470-476, July 1976.
17. J. Lillis, C.-K. Cheng, T.-T. Y. Lin, and C.-Y. Ho, "New performancedriven routing techniques with explicit area/delay tradeoffs and simultaneous wire sizing," in Proc. ACM/IEEE Design Automat. Conf., 1996, pp. 395-00.
18. R. L. Garden, IV, 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.
19. J. Rubinstein, P. Penfield, and M. A. Horowitz, "Signal delay in RC tree networks," IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 202-211, July 1983.