Maze routing steiner trees with effective critical sink optimization

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2007, Pages 135-142

  Hentschke, Renato F ^a   Narasimham, Jaganathan ^b   Johann, Marcelo O ^a   Reis, Ricardo L ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Maze routing; Steiner trees; Timing driven synthesis

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; NETWORK ROUTING;

MAZE ROUTING; PATH SEARCH ALGORITHMS; STEINER TREES; TIMING DRIVEN SYNTHESIS;

INTERCONNECTION NETWORKS;

EID: 34748924550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1231996.1232024     Document Type: Conference Paper

References (21)

1. C. J. Alpert, M. Hrkic, J. Hu, and S. T. Quay. Fast and flexible buffer trees that navigate the physical layout environment. In DAC '04: Proceedings of the 41st annual conference on Design automation, pages 24-29, New York, NY, USA, 2004. ACM Press.
2. C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, and D. Karger. Prim-dijkstra tradeoffs for improved performance-driven routing tree design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 14:890-896, 1995.
3. K. D. Boese, A. B. Kahng, and B. A. McCoy. Near optimal critical sink routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 14:1417-1436, 1995.
4. M. Borah, R. M. Owens, and M. J. Irwin. A fast algorithm for minimizing the elmore delay to identified critical sinks. IEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 16:753-759.
5. A. Caldwell. Personal contact, 1997.
6. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong. Provably good performance driven routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11:739-752, 1992.
7. J. Cong, K.-S. Leung, and D. Zhou. Performance-driven interconnect design based on distributed re delay model. In DAC '93: Proceedings of the 30th international conference on Design automation, pages 606-611, New York, NY, USA, 1993. ACM Press.
8. W. C. Elmore. The transient response of damped linear network with particular regard to wideband amplifiers. Journal of Applied Physics, 19:55-63, 1948.
9. S. S. S. H. Hou, J. Hu. Non-hanan routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18:436-444, 1999.
10. M. Hannan. On steiner problem with rectilinear distance. SIAM Jour. on App. Math, 30:255-265, 1966.
11. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Science and Cybernetics, SSC-4:100-107, 1968.
12. X. Hong, T. Xue, E. S. Kuh, C.-K. Cheng, and J. Huang. Performance-driven steiner tree algorithm for global routing. In DAC '93: Proceedings of the 30th international conference on Design automation, pages 177-181, New York, NY, USA, 1993. ACM Press.
13. A. Khang and G. Robins. On Optimal Interconnects for VLSI. Kluwer Academic, Boston, MA, 1995.
14. C. Lee. An algorithm for path connections and its applications. IRE Transactions on Electronics Computers, pages 346-365, September 1961.
15. J. Lillis, C.-K. Cheng, T.-T. Y. Lin, and C.-Y. Ho. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing. In DAC '96: Proceedings of the 33rd annual conference on Design automation, pages 395-400, New York, NY, USA, 1996. ACM Press.
16. S. Prasitjutrakul and W. J. Kubitz. A timing-driven global router for custom chip design. In ICCAD 2004: Proceedings of the International Conference on Computer-Aided Design, pages 48-51, 1990.
17. H. S-W., A. Jagannathan, and J. Lillis. Timing-driven maze routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19:234-241, 2000.
18. Z. Shen, C Chu, and Y.-M. Li. Efficient rectilinear steiner tree construction with rectilinear blockages. In Proceedings of the 2005 International Conference on Computer Design - ICCD, 2005.
19. J. Xu, X. Hong, T. Jing, Y. Cai, and J. Gu. An efficient hierarchical timing-driven steiner tree algorithm for global routing. In ASP-DAC '02: Proceedings of the 2002 conference on Asia South Pacific design automation/VLSI Design, page 473, Washington, DC, USA, 2002. IEEE Computer Society.
20. M. Zachariasen. Rectilinear full steiner tree generation. Networks, 33:125-133, 1999.
21. H. Zhou. Efficient steiner tree construction based on spanning graphs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004.