DocumentCode
1747888
Title
Creating and exploiting flexibility in Steiner trees
Author
Bozorgzadeh, Elaheh ; Kastner, Ryan ; Sarrafzadeh, Majid
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fYear
2001
fDate
2001
Firstpage
195
Lastpage
198
Abstract
This paper presents the concept of flexibility-a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net with a flexible Steiner tree increases its routability. Experiments with a global router show that congestion is improved by approximately 20%.
Keywords
delays; integrated circuit layout; network routing; network topology; trees (mathematics); Steiner trees; flexibility; geometric property; global router; optimal algorithm; routability; Circuits; Computer science; Delay; Permission; Routing; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2001. Proceedings
ISSN
0738-100X
Print_ISBN
1-58113-297-2
Type
conf
DOI
10.1109/DAC.2001.156134
Filename
935503
Link To Document