Study on Partition-Based Routing Problems in Electronic Design Automation
博士 === 中原大學 === 電子工程研究所 === 96 === In this thesis, we study how to improve the routing results in the electronic design automation, EDA, by using the partition-based method. We observe the maximum source-to-terminal delay can be improved by the partition-based method, which takes the source position...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/56426655745346347778 |
id |
ndltd-TW-096CYCU5428043 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096CYCU54280432015-10-13T14:53:14Z http://ndltd.ncl.edu.tw/handle/56426655745346347778 Study on Partition-Based Routing Problems in Electronic Design Automation 切割為基礎繞線問題之研究 Hsin-Hsiung Huang 黃信雄 博士 中原大學 電子工程研究所 96 In this thesis, we study how to improve the routing results in the electronic design automation, EDA, by using the partition-based method. We observe the maximum source-to-terminal delay can be improved by the partition-based method, which takes the source position to divide the routing area into k sub-regions and individually constructs each routing tree for each sub-region. In the thesis, we will discuss the partition-based routing by listing the problems and giving the effective solutions. First, we study two Manhattan-architecture routing problems and propose two effective algorithms to solve them. For the first problem, we propose a timing-driven routing tree construction, which utilizes the partitioning to minimize the maximum source-to-terminal delay and adds the terminal-to-terminal edges in the spanning graph to minimize the total wirelength, makes a balance between the delay and wirelength. For the second problem, we propose a hybrid approach, which analyzes the density distribution by two density functions and partitions the routing area into a set of sub-regions, simultaneously minimizes the total wirelength and runtime. In contrast to the traditional method, our algorithm is more flexible to automatically apply the multiple approaches for each sub-region by two density functions. Second, we study two X-architecture routing problems and provide two effective algorithms to solve them. For the first problem, a partition-based method, which partitions the routing area into a set of sub-regions and applies the delaunay triangulation algorithm for each sub-region, is to minimize the maximum source-to-terminal delay and the total wirelength. For the second problem, we incorporate two novel concepts, including the virtual obstacles for handling the nonrectangular obstacles and the virtual nodes to minimize the total wirelength. Furthermore, we partition the routing area and apply the above new approach to construct the routing tree with rectangular/nonrectangular obstacles for each sub-region. In contrast to the previous works, our approach can handle the timing-driven routing with the obstacles. Tsai-Ming Hsieh 謝財明 2008 學位論文 ; thesis 97 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 中原大學 === 電子工程研究所 === 96 === In this thesis, we study how to improve the routing results in the electronic design automation, EDA, by using the partition-based method. We observe the maximum source-to-terminal delay can be improved by the partition-based method, which takes the source position to divide the routing area into k sub-regions and individually constructs each routing tree for each sub-region. In the thesis, we will discuss the partition-based routing by listing the problems and giving the effective solutions.
First, we study two Manhattan-architecture routing problems and propose two effective algorithms to solve them. For the first problem, we propose a timing-driven routing tree construction, which utilizes the partitioning to minimize the maximum source-to-terminal delay and adds the terminal-to-terminal edges in the spanning graph to minimize the total wirelength, makes a balance between the delay and wirelength. For the second problem, we propose a hybrid approach, which analyzes the density distribution by two density functions and partitions the routing area into a set of sub-regions, simultaneously minimizes the total wirelength and runtime. In contrast to the traditional method, our algorithm is more flexible to automatically apply the multiple approaches for each sub-region by two density functions.
Second, we study two X-architecture routing problems and provide two effective algorithms to solve them. For the first problem, a partition-based method, which partitions the routing area into a set of sub-regions and applies the delaunay triangulation algorithm for each sub-region, is to minimize the maximum source-to-terminal delay and the total wirelength. For the second problem, we incorporate two novel concepts, including the virtual obstacles for handling the nonrectangular obstacles and the virtual nodes to minimize the total wirelength. Furthermore, we partition the routing area and apply the above new approach to construct the routing tree with rectangular/nonrectangular obstacles for each sub-region. In contrast to the previous works, our approach can handle the timing-driven routing with the obstacles.
|
author2 |
Tsai-Ming Hsieh |
author_facet |
Tsai-Ming Hsieh Hsin-Hsiung Huang 黃信雄 |
author |
Hsin-Hsiung Huang 黃信雄 |
spellingShingle |
Hsin-Hsiung Huang 黃信雄 Study on Partition-Based Routing Problems in Electronic Design Automation |
author_sort |
Hsin-Hsiung Huang |
title |
Study on Partition-Based Routing Problems in Electronic Design Automation |
title_short |
Study on Partition-Based Routing Problems in Electronic Design Automation |
title_full |
Study on Partition-Based Routing Problems in Electronic Design Automation |
title_fullStr |
Study on Partition-Based Routing Problems in Electronic Design Automation |
title_full_unstemmed |
Study on Partition-Based Routing Problems in Electronic Design Automation |
title_sort |
study on partition-based routing problems in electronic design automation |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/56426655745346347778 |
work_keys_str_mv |
AT hsinhsiunghuang studyonpartitionbasedroutingproblemsinelectronicdesignautomation AT huángxìnxióng studyonpartitionbasedroutingproblemsinelectronicdesignautomation AT hsinhsiunghuang qiègēwèijīchǔràoxiànwèntízhīyánjiū AT huángxìnxióng qiègēwèijīchǔràoxiànwèntízhīyánjiū |
_version_ |
1717760366552809472 |