Improved global routing through congestion estimation

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 28-31

  Hadsell, Raia T ^a   Madden, Patrick H ^a  

^a BINGHAMTON UNIVERSITY   (United States)

Author keywords

Congestion; Global routing; Steiner trees

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); COSTS; ROUTERS; TREES (MATHEMATICS);

GLOBAL ROUTING TOOLS;

SYSTEMS ANALYSIS;

EID: 0043092229     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775832.775842     Document Type: Conference Paper

References (15)

1. C. Albrecht. Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 20(5):622-631, May 2001.
2. M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 13(12):1563-1568, December 1994.
3. J. Cong and P. H. Madden. Performance driven multi-layer general area routing for pcb/mcm designs. In Proc. Design Automation Conf, pages 356-361, 1998.
4. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
5. Andrew Kahng and Gabriel Robins. A new class of steiner tree heuristics with good performance: the iterated 1-steiner approach. In Proc. Design Automation Conf, pages 428-431, 1990.
6. Ryan Kastner, Elaheh Bozogzadeh, and Majid Sarrafzadeh. Predictable routing. Proc. Int. Conf. on Computer Aided Design, pages 110-113, 2000.
7. Ryan Kastner, Elaheh Bozorgzadeh, and Majid Sarrafzadeh. An exact algorithm for coupling-free routing. In Proc. Int. Symp. on Physical Design, pages 10-15, 2001.
8. C.-K. Koh and P. H. Madden. Manhattan or non-manhattan? a study of alternative vlsi routing architectures. In Proc. Great Lakes Symposium on VLSI, pages 47-52, 2000.
9. J. B. Kruskal. On the shortest spanning subtree of a graph. Proc. American Math Society, 7:48-50, 1956.
10. Kusnadi and Jo Dale Carothers. A method of measuring nets routability for MCM's general area routing problems. In Proc. Int. Symp. on Physical Design, pages 186-194, 1999.
11. Ralph Linsker. An iterative-improvement penalty-function-driven wire routing system. IBM Journal of Research and Development, 28(5):613-624, September 1984.
12. Fan Mo, Abdallah Tabbara, and Robert K. Brayton. A force-directed maze router. In Proc. Int. Conf. on Computer Aided Design, pages 404-408, 2001.
13. R. C. Prim. Shortest connecting networks. Bell System Technical Journal, 31:1398-1401, 1957.
14. A. Rohe and U. Brenner. An effective congestion driven placement framework. In Proc. Int. Symp. on Physical Design, pages 1-6, 2002.
15. W. Swartz and C. Sechen. A new generalized row-based global router. In Proc. Design Automation Conf, pages 491-498, 1993.