DocumentCode
3212556
Title
Mixed spanning trees: a technique for performance-driven routing
Author
Salowe, Jeffrey S. ; Richards, Dana S. ; Wrege, Dallas E.
Author_Institution
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA
fYear
1993
fDate
5-6 Mar 1993
Firstpage
62
Lastpage
66
Abstract
Presents a new strategy for performance-driven global routing. This strategy focuses on the creation of spanning trees whose properties are under the control of the designer. The authors use it to construct a spanning tree with simultaneous, provable performance guarantees on total length, single-source shortest path length, and bottleneck path length. For rectilinear problems on n terminals in the plane, such a tree can be constructed in O (n log n ) time
Keywords
VLSI; circuit layout CAD; network routing; trees (mathematics); bottleneck path length; global routing; performance-driven routing; rectilinear problems; single-source shortest path length; spanning trees; Computer science; Delay; Labeling; Routing; Tree graphs; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI, 1993. 'Design Automation of High Performance VLSI Systems', Proceedings., Third Great Lakes Symposium on
Conference_Location
Kalamazoo, MI
Print_ISBN
0-8186-3430-8
Type
conf
DOI
10.1109/GLSV.1993.224480
Filename
224480
Link To Document