research-article

Public Access

Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid

Authors:

Sheng-En David Lin,

Dae Hyun KimAuthors Info & Claims

ISPD '18: Proceedings of the 2018 International Symposium on Physical Design

Pages 18 - 25

https://doi.org/10.1145/3177540.3178240

Published: 25 March 2018 Publication History

Abstract

Given a set of pins, a Rectilinear Steiner Minimum Tree (RSMT) connects the pins using only rectilinear edges with the minimum wirelength. RSMT construction is heavily used at various design steps such as floorplanning, placement, routing, and interconnect estimation and optimization, so fast algorithms to construct RSMTs have been developed for many years. However, RSMT construction is an NP-hard problem, so even a fast RSMT construction algorithm such as GeoSteiner [7] is too slow to use in electronic design automation (EDA) tools. FLUTE, a lookup-table-based RSMT construction algorithm, builds and uses a routing topology database to quickly construct RSMTs[5]. However, FLUTE outputs only one RSMT for a given set of pin locations. In this paper, we develop an algorithm to build a database of all RSMTs on the Hanan grid for up to nine pins. The database will be able to help minimize routing congestion and maximize the routability in the design of modern very-large-scale integration layouts.

References

[1]

Manjit Borah, Robert Michael Owens, and Mary Jane Irwin. 1994. An Edge-Based Heuristic for Steiner Routing, Vol. Vol. 13. 1563--1568.

Digital Library

[2]

Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Lei He, and Xianlong Hong. 2007. DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm. 256--261.

[3]

Yen-Jung Chang, Yu-Ting Lee, Jhih-Rong Giao, Pei-Ci Wu, and Ting-Chi Wang. 2010. NTHU-Route 2.0: A Robust Global Router for Modern Designs, Vol. Vol. 29. 1931--1944.

Digital Library

[4]

Minsik Cho and David Z. Pan. 2007. BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP, Vol. Vol. 26. 2130--2143.

Digital Library

[5]

Chris Chu and Yiu-Chung Wong. 2008. FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design, Vol. Vol. 27. 70--83.

Digital Library

[6]

M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.

Digital Library

[7]

GeoSteiner. {n. d.}. Software for Computing Steiner Trees. http://www.geosteiner.com. (. {n. d.}).

[8]

J. Griffith, G. Robins, J. S. Salowe, and Tongtong Zhang. 1994. Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time, Vol. Vol. 13. 1351--1365.

Digital Library

[9]

M. Hanan. 1966. On Steiner's Problem with Rectilinear Distance. SIAM Journal on Applied Mathematics, Vol. Vol. 14. 255--265.

[10]

F. K. Hwang, D. S. Richards, and P. Winter. 1992. The Steiner Tree Problem. Elsevier.

[11]

Andrew B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. 2003. Highly Scalable Algorithms for Rectilinear and Octilinear Steiner Trees. 827--833.

Digital Library

[12]

Ion I. Mandoiu, Vijay V. Vazirani, and Joseph L. Ganley. 2000. A New Heuristic for Rectilinear Steiner Trees, Vol. Vol. 19. 1129--1139.

Digital Library

[13]

Michael D. Moffitt. 2008. MaizeRouter: Engineering an Effective Global Router, Vol. Vol. 27. 2017--2026.

Digital Library

[14]

Muhammet Mustafa Ozdal and Martin D. F. Wong. 2007. Archer: A History-Driven Global Routing Algorithm. 488--495.

Digital Library

[15]

Tai-Hsuan Wu, Azadeh Davoodi, and Jeffrey T. Linderoth. 2009. GRIP: Scalable 3D Global Routing Using Integer Programming. 320--325.

Digital Library

[16]

Yue Xu, Yanheng Zhang, and Chris Chu. 2009. FastRoute 4.0: Global Router with Efficient Via Minimization. 576--581.

Digital Library

[17]

Hai Zhou. 2004. Efficient Steiner Tree Construction Based on Spanning Graphs, Vol. Vol. 23. 704--710.

Digital Library

Cited By

Dewan MLin SKim D(2023)Construction of All Multilayer Monolithic RSMTs and Its Application to Monolithic 3D IC RoutingACM Transactions on Design Automation of Electronic Systems10.1145/362695829:1(1-28)Online publication date: 18-Dec-2023
https://dl.acm.org/doi/10.1145/3626958
Liu GChen XZhou RXu SChen YChen G(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
https://dl.acm.org/doi/10.1016/j.asoc.2021.107215
Chen XZhou RLiu GChen ZGuo W(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
https://dl.acm.org/doi/10.1145/3442442.3451143
Show More Cited By

Index Terms

Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
      1. Wire routing

Recommendations

Construction of All Multilayer Monolithic Rectilinear Steiner Minimum Trees on the 3D Hanan Grid for Monolithic 3D IC Routing
ISPD '19: Proceedings of the 2019 International Symposium on Physical Design

Monolithic three-dimensional~(3D) integration enables stacking multiple ultra-thin silicon tiers in a single package, thereby providing smaller footprint area, shorter wirelength, higher performance, and lower power consumption than conventional planar ...
Efficient obstacle-avoiding rectilinear steiner tree construction
ISPD '07: Proceedings of the 2007 international symposium on Physical design

Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (called Steiner points), and avoids running through any obstacle to ...
Obstacle-avoiding rectilinear Steiner tree construction
ICCAD '08: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design

In today's VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. This problem has attracted a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISPD '18: Proceedings of the 2018 International Symposium on Physical Design

March 2018

178 pages

ISBN:9781450356268

DOI:10.1145/3177540

General Chair:
Chris Chu
Iowa State University
,
Program Chair:
Ismail Bustany
Xilinx Inc.

Copyright © 2018 ACM.

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]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Washington State University
Defense Advanced Research Projects Agency

Conference

ISPD '18

Sponsor:

SIGDA

ISPD '18: International Symposium on Physical Design

March 25 - 28, 2018

California, Monterey, USA

Acceptance Rates

Overall Acceptance Rate 62 of 172 submissions, 36%

Upcoming Conference

ISPD '25

Sponsor:
sigda

International Symposium on Physical Design

March 16 - 19, 2025

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
592
Total Downloads

Downloads (Last 12 months)141
Downloads (Last 6 weeks)21

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dewan MLin SKim D(2023)Construction of All Multilayer Monolithic RSMTs and Its Application to Monolithic 3D IC RoutingACM Transactions on Design Automation of Electronic Systems10.1145/362695829:1(1-28)Online publication date: 18-Dec-2023
https://dl.acm.org/doi/10.1145/3626958
Liu GChen XZhou RXu SChen YChen G(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
https://dl.acm.org/doi/10.1016/j.asoc.2021.107215
Chen XZhou RLiu GChen ZGuo W(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
https://dl.acm.org/doi/10.1145/3442442.3451143
Chen GYoung E(2020)SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2019.289465339:6(1217-1230)Online publication date: Jun-2020
https://doi.org/10.1109/TCAD.2019.2894653
Chen XZhou RLiu GWang X(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
https://dl.acm.org/doi/10.1007/978-3-030-60029-7_12
Lin SKim DBustany ISwartz W(2019)Construction of All Multilayer Monolithic Rectilinear Steiner Minimum Trees on the 3D Hanan Grid for Monolithic 3D IC RoutingProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309749(57-64)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309749

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten