A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Tree Construction
碩士 === 國立清華大學 === 資訊工程學系 === 95 === In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today’s design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very pra...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71054094549282105296 |
| Summary: | 碩士 === 國立清華大學 === 資訊工程學系 === 95 === In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today’s design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this thesis we present a fast and stable algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelegnth. The experimental results show our algorithm achieves good wirelength results and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.
|
|---|