Extending ML-OARSMT to net open locator with efficient and effective boolean operations

Bing Hui Jiang, Hung-Ming Chen

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2018 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018 - Digest of Technical Papers
發行者Institute of Electrical and Electronics Engineers Inc.
ISBN(電子)9781450359504
DOIs
出版狀態Published - 5 十一月 2018
事件37th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018 - San Diego, United States
持續時間: 5 十一月 20188 十一月 2018

出版系列

名字IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
ISSN(列印)1092-3152

Conference

Conference37th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018
國家United States
城市San Diego
期間5/11/188/11/18

指紋 深入研究「Extending ML-OARSMT to net open locator with efficient and effective boolean operations」主題。共同形成了獨特的指紋。

引用此