A Maze Routing-Based Methodology With Bounded Exploration and Path-Assessed Retracing for Constrained Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction

Author:

Lin Kuen-Wey1,Lin Yeh-Sheng1,Li Yih-Lang1,Lin Rung-Bin2

Affiliation:

1. National Chiao Tung University, University Road, Hsinchu, Taiwan

2. Yuan Ze University, Yuan-Tung Road, Chung-Li, Taiwan

Abstract

Owing to existing intellectual properties, prerouted nets, and power/ground wires, the routing of a system on chip design demands to detour around multilayer obstacles. Traditional approaches for the multilayer obstacle-avoiding rectilinear Steiner tree (ML-OARST) problem are thus nonmaze routing-based approaches for runtime issues, yet they cannot be directly applied to deal with additional constraints such as variant edge weights on a routing layer. In this article, we propose the maze routing-based methodology with bounded exploration and path-assessed retracing to reduce runtime and routing cost for the constrained ML-OARST construction problem. The exploration of maze routing is bounded to reduce the runtime; the costs of connecting pins are computed to select Steiner points in the retracing phase. To further reduce the routing cost, we develop a Steiner point-based ripping-up and rebuilding scheme for altering tree topology. Experimental results on industrial and randomly generated benchmarks demonstrate that the proposed methodology can provide a solution with good quality in terms of routing cost and has a significant speedup compared to traditional maze routing. A commercial tool is also used to show the effectiveness of the proposed methodology.

Funder

2017 ACM Great Lakes Symposium on VLSI

MOST

Publisher

Association for Computing Machinery (ACM)

Subject

Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications

Reference22 articles.

1. FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design

2. T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press Cambridge MA. T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press Cambridge MA.

3. An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane

4. The Rectilinear Steiner Tree Problem is $NP$-Complete

5. On Steiner’s Problem with Rectilinear Distance

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Obstacle-Aware Multicast Routing Algorithm for Large-Scale LEO Constellations;IEEE Transactions on Network Science and Engineering;2024-09

2. A Rule-Based High Efficient Obstacle-Avoiding RSMT Algorithm for VLSI Routing;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19

3. Obstacle Avoidance Rectilinear Steiner Minimal Tree Length Estimation Using Deep Learning;2023 22nd International Symposium on Communications and Information Technologies (ISCIT);2023-10-16

4. Software Defined Multicast for Large-Scale Multi-Layer LEO Satellite Networks;IEEE Transactions on Network and Service Management;2022-09

5. A Reinforcement Learning Agent for Obstacle-Avoiding Rectilinear Steiner Tree Construction;Proceedings of the 2022 International Symposium on Physical Design;2022-04-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3