Extending ML-OARSMT to Net Open Locator with Efficient and Effective Boolean Operations

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2018-01-01

期刊名稱

2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS

ISSN

1933-7760

ISBN

978-1-4503-5950-4

語言

英文

摘要

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.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/153313