Extending ML-OARSMT to Net Open Locator with Efficient and Effective Boolean Operations
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
0 | en_US |
dc.citation.spage |
0 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Jiang, Bing-Hui | en_US |
dc.contributor.author |
Chen, Hung-Ming | en_US |
dc.contributor.department |
電子工程學系及電子研究所 | zh_TW |
dc.contributor.department |
電控工程研究所 | zh_TW |
dc.contributor.department |
Department of Electronics Engineering and Institute of Electronics | en_US |
dc.contributor.department |
Institute of Electrical and Control Engineering | en_US |
dc.date.accessioned |
2019-12-13T01:12:53Z | |
dc.date.available |
2019-12-13T01:12:53Z | |
dc.date.issued |
2018-01-01 | en_US |
dc.description.abstract |
Multi-layer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) problem has been extensively studied in recent years. In this work, we consider a variant of ML-OARSMT problem and extend the applicability to the net open location finder. Since ECO or router limitations may cause the open nets, we come up with a framework to detect and reconnect existing nets to resolve the net opens. Different from prior connection graph based approach, we propose a technique by applying efficient Boolean operations to repair net opens. Our method has good quality and scalability and is highly parallelizable. Compared with the results of ICCAD-2017 contest, we show that our proposed algorithm can achieve the smallest cost with 4.81 speedup in average than the top-3 winners. | en_US |
dc.identifier.doi |
10.1145/3240765.3240807 | en_US |
dc.identifier.isbn |
978-1-4503-5950-4 | en_US |
dc.identifier.issn |
1933-7760 | en_US |
dc.identifier.journal |
2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1145/3240765.3240807 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/153313 | |
dc.identifier.wosnumber |
WOS:000494640800081 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Routing | en_US |
dc.subject |
physical design | en_US |
dc.subject |
rectilinear Steiner tree | en_US |
dc.subject |
obstacle-avoidance | en_US |
dc.subject |
Boolean operations | en_US |
dc.title |
Extending ML-OARSMT to Net Open Locator with Efficient and Effective Boolean Operations | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Jiang, B.-H., & Chen, H.-M. (2018). Extending ML-OARSMT to Net Open Locator with Efficient and Effective Boolean Operations. 2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS, 0. https://doi.org/10.1145/3240765.3240807
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/153313