skip to main content
research-article

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

Published: 09 May 2018 Publication History

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.

References

[1]
C. Chu and Y.-C. Wong. 2008. FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 1, 70--83.
[2]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press, Cambridge, MA.
[3]
Z. Feng, Y. Hu, T. Jing, X. Hong, X. Hu, and G. Yan. 2006. An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane. In Proceedings of the 2006 International Symposium on Physical Design (ISPD’06), 48--55.
[4]
M. R. Garey and D. S. Johnson. 1977. The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 4, 826--834.
[5]
M. Hanan. 1966. On Steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics 14, 2, 255--265.
[6]
T. Huang and E. F. Y. Young. 2013. ObSteiner: An exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32, 6, 882--893.
[7]
C. Y. Lee. 1961. An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10, 3, 346--365.
[8]
L. Li, Z. Qian, and E. F. Y. Young. 2009. Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design—Digest of Technical Papers (ICCAD’09). 21--25.
[9]
L. Li and E. F. Y. Young. 2008. Obstacle-avoiding rectilinear Steiner tree construction. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design—Digest of Technical Papers (ICCAD’08). 523--528.
[10]
C.-W. Lin, S.-Y. Chen, C.-F. Li, Y.-W. Chang, and C.-L. Yang. 2008a. Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 4, 643--653.
[11]
C.-W. Lin, S.-L. Huang, K.-C. Hsu, M.-X. Lee, and Y.-W. Chang. 2008b. Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 11, 2007--2016.
[12]
W.-H. Liu, W.-C. Kao, Y.-L. Li, and K.-Y. Chao. 2010. Multi-threaded collision-aware global routing with bounded-length maze routing. In Proceedings of the 47th Design Automation Conference (DAC’10). 200--205.
[13]
C.-H. Liu, C.-X. Lin, I.-C. Chen, D. T. Lee, and T.-C. Wang. 2014. Efficient multilayer obstacle-avoiding rectilinear Steiner tree construction based on geometric reduction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33, 12, 1928--1941.
[14]
J. Long, H. Zhou, and S. O. Memik. 2008. EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 12, 2169--2182.
[15]
M. D. Moffitt. 2009. Global routing revisited. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design—Digest of Technical Papers (ICCAD’09). 805--808.
[16]
D. Warme, P. Winter, and M. Zachariasen. 2018. GeoSteiner. Retrieved March 23, 2018, from http://www.diku.dk/∼martinz/geosteiner/.
[17]
Y.-F. Wu, P. Widmayer, M. Schlag, and C.-K. Wong. 1987. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Transactions on Computers 36, 3, 321--331.
[18]
C.-H. Liu, S.-Y. Kuo, D. T. Lee, C.-S. Lin, J.-H. Weng, and S.-Y. Yuan. 2012. Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point-based algorithm. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 31, 7, 1050--1060.
[19]
Naveed Sherwani. 1998. Algorithms for VLSI Physical Design Automation (3rd ed.). Springer.
[20]
P. E. Hart, N. J. Nilsson, and B. Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4, 2, 100--107.
[21]
R. Hentschke, J. Narasimhan, M. Johann, and R. Reis. 2009. Maze routing Steiner trees with delay versus wire length tradeoff. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 17, 8, 1073--1086.
[22]
K.-W. Lin, Y.-S. Lin, Y.-L. Li, and R.-B. Lin. 2017. A maze routing-based algorithm for ML-OARST with pre-selecting and re-building Steiner points. In Proceedings of the Great Lakes Symposium on VLSI (GLSVLSI’17). 399--402.

Cited By

View all
  • (2024)Obstacle-Aware Multicast Routing Algorithm for Large-Scale LEO ConstellationsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2024.340427111:5(4551-4563)Online publication date: Sep-2024
  • (2024)A Rule-Based High Efficient Obstacle-Avoiding RSMT Algorithm for VLSI Routing2024 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS58744.2024.10558430(1-5)Online publication date: 19-May-2024
  • (2023)Obstacle Avoidance Rectilinear Steiner Minimal Tree Length Estimation Using Deep Learning2023 22nd International Symposium on Communications and Information Technologies (ISCIT)10.1109/ISCIT57293.2023.10376036(1-6)Online publication date: 16-Oct-2023
  • Show More Cited By

Index Terms

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

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Design Automation of Electronic Systems
    ACM Transactions on Design Automation of Electronic Systems  Volume 23, Issue 4
    Special Section on Advances in Physical Design Automation and Regular Papers
    July 2018
    316 pages
    ISSN:1084-4309
    EISSN:1557-7309
    DOI:10.1145/3217208
    • Editor:
    • Naehyuck Chang
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Journal Family

    Publication History

    Published: 09 May 2018
    Accepted: 01 January 2018
    Revised: 01 July 2017
    Received: 01 May 2017
    Published in TODAES Volume 23, Issue 4

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Layout
    2. Steiner tree
    3. physical design
    4. routing

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Funding Sources

    • 2017 ACM Great Lakes Symposium on VLSI (GLSVLSI'17)
    • MOST

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)33
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 25 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Obstacle-Aware Multicast Routing Algorithm for Large-Scale LEO ConstellationsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2024.340427111:5(4551-4563)Online publication date: Sep-2024
    • (2024)A Rule-Based High Efficient Obstacle-Avoiding RSMT Algorithm for VLSI Routing2024 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS58744.2024.10558430(1-5)Online publication date: 19-May-2024
    • (2023)Obstacle Avoidance Rectilinear Steiner Minimal Tree Length Estimation Using Deep Learning2023 22nd International Symposium on Communications and Information Technologies (ISCIT)10.1109/ISCIT57293.2023.10376036(1-6)Online publication date: 16-Oct-2023
    • (2022)Software Defined Multicast for Large-Scale Multi-Layer LEO Satellite NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315155219:3(2119-2130)Online publication date: Sep-2022
    • (2022)Social learning discrete Particle Swarm Optimization based two-stage X-routing for IC design under Intelligent Edge Computing architectureApplied Soft Computing10.1016/j.asoc.2021.107215104:COnline publication date: 22-Apr-2022
    • (2021)Timing-Driven X-architecture Steiner Minimum Tree Construction Based on Social Learning Multi-Objective Particle Swarm OptimizationCompanion Proceedings of the Web Conference 202110.1145/3442442.3451143(77-84)Online publication date: 19-Apr-2021
    • (2020)An Efficient Rectilinear and Octilinear Steiner Minimal Tree Algorithm for Multidimensional EnvironmentsIEEE Access10.1109/ACCESS.2020.29778258(48141-48150)Online publication date: 2020
    • (2020)SLPSO-Based X-Architecture Steiner Minimum Tree ConstructionWeb Information Systems and Applications10.1007/978-3-030-60029-7_12(131-142)Online publication date: 23-Sep-2020

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media