Title :
Critical net routing
Author :
Cohoon, J.F. ; Randall, L.J.
Author_Institution :
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA
Abstract :
A critical net has been routed traditionally by interconnecting its terminals with a minimum length rectilinear Steiner tree (MRST). A novel interconnection form, the maximum performance tree (MPT), that better approximates an interconnection with optimal circuit performance is proposed. In addition, a heuristic approach is presented that quickly generates MPTs, and the quality of these trees is compared with MRSTs for several net instances
Keywords :
circuit layout CAD; trees (mathematics); critical net routing; maximum performance tree; minimum length rectilinear Steiner tree; terminal interconnection; Circuit optimization; Computer science; Integrated circuit interconnections; Routing; Steiner trees; Time measurement; Wire;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1991. ICCD '91. Proceedings, 1991 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-2270-9
DOI :
10.1109/ICCD.1991.139875
