research-article

FH-OAOS: A Fast Four-Step Heuristic for Obstacle-Avoiding Octilinear Steiner Tree Construction

Authors:

Guolong ChenAuthors Info & Claims

ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 21, Issue 3

Article No.: 48, Pages 1 - 31

https://doi.org/10.1145/2856033

Published: 20 April 2016 Publication History

Abstract

With the sharp increase of very large-scale integrated (VLSI) circuit density, we are faced with many knotty issues. Particularly in the routing phase of VLSI physical design, the interconnection effects directly relate to the final performance of circuits. However, the optimization capability of traditional rectilinear architecture is limited; thus, both academia and industry have been devoted to nonrectilinear architecture in recent years, especially octilinear architecture, which is the most promising because it can greatly improve the performance of modern chips. In this article, we design FH-OAOS, an obstacle-avoiding algorithm in octilinear architecture, by constructing an obstacle-avoiding the octilinear Steiner minimal tree (OAOSMT). Our approach first constructs an obstacle-free Euclidean minimal spanning tree (OFEMST) on the given pins based on Delaunay triangulation (DT). Then, two lookup tables about OFEMST’s edge are generated, which can be seen as the information center of FH-OAOS and can provide information support for algorithm operation. Next, an efficient obstacle-avoiding strategy is proposed to convert the OFEMST into an obstacle-avoiding octilinear Steiner tree (OAOST). Finally, the generated OAOST is refined to construct the final OAOSMT by applying three effective strategies. Experimental results on various benchmarks show that FH-OAOS achieves 66.39 times speedup on average, while the average wirelength of the final OAOSMT is only 0.36% larger than the best existing solution.

References

[1]

J. L. Ganley and J. P. Cohoon. 1996. Rectilinear Steiner trees on a checkerboard. ACM Trans. Des. Autom. Electron. Syst. 1, 4. 512--522.

Digital Library

[2]

A. Hashimotao and J. Stevens. 1988. Wire routing by optimizing channel assignment with in large apertures. In Proceedings of the 8th Design Autom Conference (DAC’88). ACM Press, 35--49.

Digital Library

[3]

T. Y. Ho, Y. W. Chang, and S. J. Chen. 2007. Full-Chip Nanometer Routing Techniques. Springer, Berlin.

Digital Library

[4]

J. Hu and S. Sapatnekar. 2001. A survey on multi-net global routing for integrated circuits. Integration, VLSI J. 31, 1--49.

[5]

M. Hanan. 1966. On Steiners problem with rectilinear distance. SIAM J. Appl. Math. 14, 255--265.

[6]

M. Garey and D. Johnson. 1977. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826--834.

Digital Library

[7]

Y. F. Wu, P. Wirdmayer, M. D. F. Schlag, and C. K. Wong. 1987. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Trans. Comput. 36, 321--331.

Digital Library

[8]

G. Ajwani, C. Chu, and W. K. Mak. 2011. FOARS: FLUTE based obstacle-avoiding rectilinear Steiner tree construction. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 30, 194--204.

Digital Library

[9]

J. Long, H. Zhou, and S. O. Memik. 2008. EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27, 2169--2182.

Digital Library

[10]

C. W. Lin, S. Y. Chen, C. F. Li, Y. W. Chang, and C. L. Yang. 2007. Efficient obstacle-avoiding rectilinear Steiner tree construction. In Proceedings of the International Symposium on Physical Design (ISPD’07). 127--134.

Digital Library

[11]

C. H. Liu, S. Y. Yuan, S. Y. Kuo, and Y. H. Chou. 2009. An O(nlogn) path based obstacle-avoiding algorithm for rectilinear Steiner tree construction. In Proceedings of the Design Automation Conference (DAC’09). 314--319.

Digital Library

[12]

W. K. Chow, L. Li, E. F. Y. Young, and C. W. Sham. 2014. Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach. Integration, the VLSI J. 47, 105--114.

Digital Library

[13]

T. Huang and E. F. Y. Young. 2010. Obstacle-avoiding rectilinear Steiner tree construction: An optimal approach. In Proceedings of the International Conference on Computer-Aided Design (ICCAD’10). ACM Press, 610--613.

Digital Library

[14]

T. Huang and E. F. Y. Young. 2011. An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles. In Proceedings of the Design Automation Conference (DAC’11). ACM Press, 164--169.

Digital Library

[15]

T. Huang, L. Li, and E. F. Y. Young. 2011. On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 30, 718--731.

Digital Library

[16]

C. K. Koh and P. H. Madden. 2000. Manhattan or non-Manhattan? A study of alternative VLSI routing architectures. In Proceedings of the 10th Great Lakes Symposium on VLSI (GLSVLSI’00). ACM Press, 47--52.

Digital Library

[17]

S. Teig. 2000. The X architecture: Not your fathers diagonal wiring. In Proceedings of the International Workshop on System-Level Interconnect Prediction (SLIP’02). ACM Press, New York, 33--37.

Digital Library

[18]

A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. 2003. Highly scalable algorithms for rectilinear and octilinear Steiner trees. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC’03). IEEE, 827--833.

Digital Library

[19]

C. S. Coulston. 2003. Constructing exact octagonal Steiner minimal tree. In Proceedings of the Great Lakes Symposium on VLSI (GLSVLSI’03). ACM Press, 597--602.

Digital Library

[20]

T. Y. Ho, C. F. Chang, Y. W. Chang, and S. J. Chen. 2005. Multilevel full-chip routing for the X-based architecture. In Proceedings of the 42th Annual Design Automation Conference (ADAC’05). 28--29.

Digital Library

[21]

T. Arora and M. E. Mose. 2009. Ant colony optimization for power efficient routing in Manhattan and non-Manhattan VLSI architectures. In Proceedings of the Swarm Intelligent Symposium (SIS’09). 137--144.

[22]

Q. Zhu, H. Zhou, T. Jing, X. L. Hong, and Y. Yang. 2005. Spanning graph-based nonrectilinear Steiner tree algorithm. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 24, 1066--1075.

Digital Library

[23]

J. T. Yan. 2008. Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction. ACM Trans. Des. Autom. Electron. Syst. 13, 2.

Digital Library

[24]

H. H. Huang, S. P. Chang, Y. C. Lin, and T. M. Hsieh. 2009. Timing-driven non-rectangular obstacle-avoiding routing algorithm for the X-architecture. In Proceedings of the 8th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (IMCAS’09). 31--34.

Digital Library

[25]

G. G. Liu, W. Z. Guo, Y. Z. Niu, G. L. Chen, and X. Huang. 2015. A pso-based-timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft Comput. 1153--1169.

Digital Library

[26]

X. Huang, G. G. Liu, W. Z. Guo, Y. Z. Niu, and G. L. Chen. 2015. Obstacle-avoiding algorithm in X-architecture based on discrete particle swarm optimization for VLSI design. ACM Trans. Des. Autom. Electron. Syst. 20, 2.

Digital Library

[27]

T. T. Jing, Z. Feng, Y. Hu, X. L. Hong, X. D. Hu, and G. Y. Yan. 2007. λ-OAT: λ-geometry obstacle-avoiding tree construction with O (n log n) complexity. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 26, 2073--2079.

Digital Library

[28]

M. Borah, R. M. Owens, and M. J. Irwin. 1994. An edge-based heuristic for Steiner routing. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 13, 1563--1568.

Digital Library

[29]

D. M. Warme, P. Winter, and M. Zachariasen. 2000. Exact algorithms for plane Steiner tree problems: A computational study. Advances in Steiner Trees 81--116.

[30]

C. C. Tong and C. L. Wu. 1995. Routing in a three-dimensional chip. IEEE Trans. Comput. 44, 106--117.

Digital Library

[31]

F. Schmiedle R. Drechsler, and B. Becker. 2003. Exact routing with search space reduction. IEEE Trans. Comput. 52, 815--825.

Digital Library

[32]

F. Schmiedle R. Drechsler, and B. Becker. 2000. Incorporating yield enhancement into the floorplanning process. IEEE Trans. Comput. 49, 532--541.

Digital Library

[33]

H. Zhou. 2004. Efficient Steiner tree construction based on spanning graphs. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 22, 704--710.

Digital Library

[34]

S. Cinel and C. Bazlamacci. 2008. A distributed heuristic algorithm for the rectilinear Steiner minimal tree problem. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27, 2083--2087.

Digital Library

[35]

C. Chu and Y. C. Wong. 2008. FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27, 70--83.

Digital Library

[36]

X. L. Hong, Q. Zhu, T. Jing, Y. Wang, and Y. C. Cai. 2003. Non-rectilinear on-chip interconnects: An efficient routing solution with high performance. Chin. J. Semicond. 24, 225--233.

[37]

S. Fortune. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2, 153--174.

Digital Library

[38]

M. B. De, M. K. Van, M. Overmars, and C. O. Schwarzkopf. 2000. Computational Geometry: Algorithms and Applications. Springer, Berlin, 2000.

[39]

J. Ho, G. Vijayan, and C. K. Wong. 1989. A new approach to the rectilinear Steiner tree problem. In Proceedings of the 26th Design Automation Conference. ACM, 161--166.

Digital Library

[40]

C. H. Liu, S. Y. Yuan, S. Y. Kuo, and S. C. Wang. 2009. High-performance obstacle-avoiding rectilinear Steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. 14, 3, 45.

Digital Library

Cited By

Zhu YLiu GLu RHuang XGan MGuo W(2024)Timing-Driven Obstacle-Avoiding X-Architecture Steiner Minimum Tree Algorithm With Slack ConstraintsIEEE Transactions on Systems, Man, and Cybernetics: Systems10.1109/TSMC.2024.335353454:5(2927-2940)Online publication date: May-2024
https://doi.org/10.1109/TSMC.2024.3353534
Zhang TLü ZDing J(2024)Guiding Solution Based Local Search for Obstacle-Avoiding Rectilinear Steiner Minimal Tree ProblemIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2023.33062418:1(440-453)Online publication date: Feb-2024
https://doi.org/10.1109/TETCI.2023.3306241
You JZhu YHuang XYang LLiu G(2023)Obstacle-Avoidance X-Architecture Steiner Minimal Tree Algorithm Based on Deep Reinforcement Learning2023 International Conference on Artificial Intelligence of Things and Systems (AIoTSys)10.1109/AIoTSys58602.2023.00046(165-172)Online publication date: 19-Oct-2023
https://doi.org/10.1109/AIoTSys58602.2023.00046
Show More Cited By

Index Terms

FH-OAOS: A Fast Four-Step Heuristic for Obstacle-Avoiding Octilinear Steiner Tree Construction
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
      1. Wire routing
  2. Integrated circuits
    1. Interconnect
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

An efficient rectilinear Steiner tree algorithm with obstacles
CSECS'06: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing

The paper presents the algorithm which constructs the Steiner tree in the presence of the obstacles. Two accomplishments which one effectively finds the result and the other efficiently obtains the solution are proposed in this study. The first proposed ...
Seeing the forest and the trees: Steiner wirelength optimization in placemen
ISPD '06: Proceedings of the 2006 international symposium on Physical design

We show how to optimize Steiner-tree Wirelength (StWL) in global and detail placement without a significant runtime penalty, making the use of Half-Perimeter Wirelength unnecessary. Given that StWL correlates with Routed Wirelength (rWL) much better ...
Wirelength reduction by using diagonal wire
GLSVLSI '03: Proceedings of the 13th ACM Great Lakes symposium on VLSI

We study the octilinear Steiner tree to evaluate the rectilinear Steiner tree based router. First, we give the worst and average case wirelength for rectilinear routing and octilinear routing for two terminals net. Next, we show the octilinear Steiner ...

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 21, Issue 3

Special Section on New Physical Design Techniques for the Next Generation Integration Technology and Regular Papers

July 2016

434 pages

ISSN:1084-4309

EISSN:1557-7309

DOI:10.1145/2926747

Editor:
Naehyuck Chang
Korea Advanced Institute of Science and Technology, Korea

Issue’s Table of Contents

Copyright © 2016 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 20 April 2016

Accepted: 01 December 2015

Revised: 01 October 2015

Received: 01 June 2015

Published in TODAES Volume 21, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Natural Science Foundation of China
Fujian Province High School Science Fund for Distinguished Young Scholars
Program for New Century Excellent Talents in Fujian Province University
National Basic Research Program of China
Fujian Natural Science Funds for Distinguished Young Scholars
development foundation of the Education Committee of Fujian Province

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
266
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)4

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhu YLiu GLu RHuang XGan MGuo W(2024)Timing-Driven Obstacle-Avoiding X-Architecture Steiner Minimum Tree Algorithm With Slack ConstraintsIEEE Transactions on Systems, Man, and Cybernetics: Systems10.1109/TSMC.2024.335353454:5(2927-2940)Online publication date: May-2024
https://doi.org/10.1109/TSMC.2024.3353534
Zhang TLü ZDing J(2024)Guiding Solution Based Local Search for Obstacle-Avoiding Rectilinear Steiner Minimal Tree ProblemIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2023.33062418:1(440-453)Online publication date: Feb-2024
https://doi.org/10.1109/TETCI.2023.3306241
You JZhu YHuang XYang LLiu G(2023)Obstacle-Avoidance X-Architecture Steiner Minimal Tree Algorithm Based on Deep Reinforcement Learning2023 International Conference on Artificial Intelligence of Things and Systems (AIoTSys)10.1109/AIoTSys58602.2023.00046(165-172)Online publication date: 19-Oct-2023
https://doi.org/10.1109/AIoTSys58602.2023.00046
Liu GZhu YXu STang HChen Y(2022)Performance-Driven X-Architecture Routing Algorithm for Artificial Intelligence Chip Design in Smart ManufacturingACM Transactions on Management Information Systems10.1145/351942213:4(1-20)Online publication date: 10-Aug-2022
https://dl.acm.org/doi/10.1145/3519422
Huang XPan YZhang GLi BGuo WHo TSchlichtmann U(2022)PathDriver+: Enhanced Path-Driven Architecture Design for Flow-Based Microfluidic BiochipsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.310383241:7(2185-2198)Online publication date: Jul-2022
https://doi.org/10.1109/TCAD.2021.3103832
Kahng ALienig JMarkov IHu JKahng ALienig JMarkov IHu J(2022)Specialized RoutingVLSI Physical Design: From Graph Partitioning to Timing Closure10.1007/978-3-030-96415-3_7(195-222)Online publication date: 15-Jun-2022
https://doi.org/10.1007/978-3-030-96415-3_7
Zhang LHuang YChen WGuo WLiu G(2021)X-architecture Steiner Tree Algorithm with Limited Routing Length inside Obstacle2021 11th International Conference on Information Technology in Medicine and Education (ITME)10.1109/ITME53901.2021.00040(152-156)Online publication date: Nov-2021
https://doi.org/10.1109/ITME53901.2021.00040
Yang WChen YChen YYeh K(2021)Intelligent Agent-Based Predict System With Cloud Computing for Enterprise Service Platform in IoT EnvironmentIEEE Access10.1109/ACCESS.2021.30492569(11843-11871)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3049256
Yang RHu RLi YXie WXu Y(2021)Research on 5G related technologies under the new generation of information technologyJournal of Physics: Conference Series10.1088/1742-6596/1907/1/0120561907:1(012056)Online publication date: 1-May-2021
https://doi.org/10.1088/1742-6596/1907/1/012056
Fang XChen H(2021)Using vendor management inventory system for goods inventory management in IoT manufacturingEnterprise Information Systems10.1080/17517575.2021.188574316:7Online publication date: 25-Feb-2021
https://doi.org/10.1080/17517575.2021.1885743
Show More Cited By

View Options

Get Access

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents