Timing-driven maze routing

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

Volumn 19, Issue 2, 2000, Pages 234-241

  Hur, Sung Woo ^a   Jagannathan, Ashok ^a   Lillis, John ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CAPACITANCE; COMPUTER AIDED DESIGN; DYNAMIC PROGRAMMING; ELECTRIC RESISTANCE; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS;

DESIGN AUTOMATION; INTEGRATED CIRCUIT INTERCONNECTIONS; ROUTING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0033877669     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.828552     Document Type: Article

References (16)

1. C. Y. Lee, "An algorithm for path connection and its applications," IRE Trans. Electron Comput., vol. EC-10, pp. 346-365, Sept. 1961.
2. E. F. Moore, "Shortest path through a maze," in Annals of the Harvard Computing Laboratory. Cambridge, MA: Harvard Univ. Press, 1959, pt. II, vol. 30-Proc. Int. Symp. Switching Circuits.
3. J. Lillis and P. Buch, "Table-lookup methods for improved performancedriven routing," in Proc. 35th DAC. 1998, pp. 368-377.
4. H.-P. Tseng, L. Scheffer, and C. Sechen, "Timing and crosstalk driven area routing," in Proc. 35th DAC, 1998, pp. 378-381.
5. T. Xue, E. S. Kuh, and D. S. Wang, "Post global routing crosstalk risk estimation and reduction," in Proc. ICCAD, 1996, pp. 302-309.
6. H. Zhou and D. F. Wong, "Global routing with crosstalk constraints," in Proc. 35th DAC, 1998, pp. 374-377.
7. R. Nair, "A simple yet effective technique for global wiring," IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 165-172, June 1987.
8. E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: S; Prentice-Hall, 1976.
9. P. E. Hart, N.J. Nilsson, and B. Raphael, "A formal basis for the heuristic S determination of minimum cost paths," IEEE Trans. Syst, Sei. Cybern., B vol. SCC-4, pp. 100-107, July 1968.
10. W. C. Elmore, "The transient response of damped linear network with particular regard to wideband amplifiers," J. Appl. Phys., vol. 19, pp. 55-63, 1948.
11. J. P. Fishburn and C. A. Schevon, "Shaping a distributed-AC line to minimize Elmore delay," IEEE Trans. Circuits Syst.-I, vol. 42, pp. 1020-1022, Dec. 1995.
12. C.-P. Chen, Y.-P. Chen, and D. F. Wong, "Optimal wire-sizing formula under the Elmore delay model," in Proc. 33rd DAC, 1996, pp. 487-490.
13. M. Kang, W.-M. Dai, T. Dillinger, and D. LaPotin, "Delay bounded buffered tree construction for timing driven floorplanning," in Proc. ICCAD, 1997, pp. 702-712.
14. J. Lillis, C.-K. Cheng, and T.-T. Y Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," IEEE J. Solid-State Circuits, vol. 31, no. 3, pp. 437-447, 1996.
15. H. Zhou, D. F. Wong, I.-M. Liu, and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations," in Proc. 36th DAC, 1999, pp. 96-99.
16. J. Lillis, C.-K. Cheng, T.-T. Y. Lin, and C.-Y. Ho, "New techniques for performance driven routing with explicit area/delay tradeoff and simultaneous wire sizing," in Proc. 33rd ACM/IEEE DAC, 1996, pp. 395-400.