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

Bing Hui Jiang, Hung-Ming Chen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2018 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018 - Digest of Technical Papers
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781450359504
DOIs
StatePublished - 5 Nov 2018
Event37th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018 - San Diego, United States
Duration: 5 Nov 20188 Nov 2018

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
ISSN (Print)1092-3152

Conference

Conference37th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018
CountryUnited States
CitySan Diego
Period5/11/188/11/18

Keywords

  • boolean operations
  • obstacle-avoidance
  • physical design
  • rectilinear steiner tree
  • routing

Fingerprint Dive into the research topics of 'Extending ML-OARSMT to net open locator with efficient and effective boolean operations'. Together they form a unique fingerprint.

Cite this