Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model
碩士 === 國立清華大學 === 資訊工程學系 === 88 === In this thesis, we will study the construction of a Steiner routing tree for a given net with the objective of minimizing the delay of the routing tree. Previous researches adopt Elmore delay model...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21939045171499348315 |
| id |
ndltd-TW-088NTHU0392029 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-088NTHU03920292016-07-08T04:23:16Z http://ndltd.ncl.edu.tw/handle/21939045171499348315 Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model 使用兩極延遲模組之最小延遲的史坦納樹結構 LiYi Lin 林立鎰 碩士 國立清華大學 資訊工程學系 88 In this thesis, we will study the construction of a Steiner routing tree for a given net with the objective of minimizing the delay of the routing tree. Previous researches adopt Elmore delay model to compute delay. We also adopt the motivations to design the flow. However, with the advancement of IC technology, a more accurate delay model is required. Therefore, in this thesis, we will use two-pole delay model to compute the cost function of a Steiner tree. Moreover, we propose a new algorithm to construct the Steiner tree. Our algorithm takes into consideration the net topology, the total wire length and the longest path from the source to sink. Experimental results show that our algorithm is very effective and efficient as compared to [8]. TingTing Hwang 黃婷婷 2000 學位論文 ; thesis 0 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立清華大學 === 資訊工程學系 === 88 === In this thesis, we will study the construction of
a Steiner routing tree for a given net with the
objective of minimizing the delay of the routing tree.
Previous researches adopt Elmore delay model
to compute delay.
We also adopt the motivations to design the flow.
However, with the advancement of IC technology, a more accurate delay
model is required. Therefore, in this thesis,
we will use two-pole delay model to compute the cost function
of a Steiner tree.
Moreover, we propose a new algorithm to construct the Steiner tree.
Our algorithm takes into consideration the net topology, the total wire
length and the longest path from the source to sink.
Experimental results show that our algorithm is very
effective and efficient as compared to [8].
|
| author2 |
TingTing Hwang |
| author_facet |
TingTing Hwang LiYi Lin 林立鎰 |
| author |
LiYi Lin 林立鎰 |
| spellingShingle |
LiYi Lin 林立鎰 Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| author_sort |
LiYi Lin |
| title |
Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| title_short |
Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| title_full |
Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| title_fullStr |
Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| title_full_unstemmed |
Construction of Minimal Delay Steiner Tree Using Two-pole Delay Model |
| title_sort |
construction of minimal delay steiner tree using two-pole delay model |
| publishDate |
2000 |
| url |
http://ndltd.ncl.edu.tw/handle/21939045171499348315 |
| work_keys_str_mv |
AT liyilin constructionofminimaldelaysteinertreeusingtwopoledelaymodel AT línlìyì constructionofminimaldelaysteinertreeusingtwopoledelaymodel AT liyilin shǐyòngliǎngjíyánchímózǔzhīzuìxiǎoyánchídeshǐtǎnnàshùjiégòu AT línlìyì shǐyòngliǎngjíyánchímózǔzhīzuìxiǎoyánchídeshǐtǎnnàshùjiégòu |
| _version_ |
1718341469775855616 |