@inproceedings{c72406b3e2dd4e67825e4ba7ecd88b42,
title = "Extending ML-OARSMT to net open locator with efficient and effective boolean operations",
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.",
keywords = "boolean operations, obstacle-avoidance, physical design, rectilinear steiner tree, routing",
author = "Jiang, {Bing Hui} and Hung-Ming Chen",
year = "2018",
month = nov,
day = "5",
doi = "10.1145/3240765.3240807",
language = "English",
series = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2018 - Digest of Technical Papers",
address = "United States",
note = "null ; Conference date: 05-11-2018 Through 08-11-2018",
}