SAT-Based On-Track Bus Routing
SAT-Based On-Track Bus Routing
复制标题
基于 SAT 的轨道公交车路线
DOI：
10.1109/tcad.2020.3007253
复制
发表时间：
2021
影响因子：
2.9
通讯作者：
Jie-Hong R. Jiang
中科院分区：
文献类型：
--
作者：
He-Teng Zhang;Masahiro Fujita;Chung-Kuan Cheng;Jie-Hong R. Jiang
在现代集成电路设计中，由于复杂的设计规则和布线约束，总线布线是一个挑战。尽管广泛的研究，国家的最先进的总线布线时，不均匀的轨道，各种障碍物，线宽度的限制，并应同时处理多个间距规则是无效的。提出了一种基于迷宫布线和布尔可满足性的总线布线框架。它可以快速生成高质量的结果，并允许进行额外的优化，例如最大限度地减少关键路径上的导线长度。2018年ICCAD竞赛中出现了许多具有挑战性的总线路由基准。在这些基准测试上的实验不仅表明，该框架比竞争对手和以前的工作更快，而且还产生了更好的结果，将总体成本提高了12%，同时最大限度地减少了间距违规的数量。
In modern integrated circuit design, bus routing is a challenge because of complex design rules and wiring constraints. Despite extensive research, state-of-the-art in bus routing is not effective when nonuniform tracks, various obstacles, wire width constraints, and multiple spacing rules should be handled simultaneously. A new bus routing framework proposed in this article is based on maze routing and Boolean satisfiability. It produces high-quality results quickly and allows for additional optimizations, such as minimizing wire length on the critical paths. A number of challenging bus routing benchmarks appeared in 2018 ICCAD Contest. Experiments on these benchmarks not only show that the framework is faster than the winners of the competition and previous work but also produces better results, improving the overall cost by 12% while at the same time minimizing the number of spacing violations.