Paper Info
Title
Routing tree topology construction to meet interconnect timing constraints
Abstract
This work presents a Steiner tree construction procedure, MVERT, to meet specified sink arrival time constraints. It is shown that the optimal tree requires the use of non-Hanan points. The procedure works in two phases: a minimum-delay Steiner tree is first constructed, after which the tree is iterativ ely modified, using an efficient binary search method, to reduce its length. Experimental results show that this procedure w orks particularly well for tec hnologies where the interconnect resistance dominates, and significant cost savings are generated.
Year
DOI
Venue
1998
10.1145/274535.274565
ISPD
Keywords
Field
DocType
procedure w,significant cost saving,non-hanan point,steiner tree construction procedure,routing tree topology construction,timing constraint,procedure work,optimal tree,minimum-delay steiner tree,efficient binary search method,iterativ ely,binary search,steiner tree
Mathematical optimization,Tree traversal,Computer science,Steiner tree problem,Algorithm,Network topology,Binary search algorithm,TEC,Interconnection,Gomory–Hu tree
Conference
ISBN
Citations 
PageRank 
1-58113-021-X
6
0.64
References 
Authors
6
2
Name
Order
Citations
PageRank
Huibo Hou1231.65
Sachin Sapatnekar24074361.60