X-architecture Steiner Minimum Tree Algorithm Considering Routing Resource Relaxation

被引：0
|
作者：
Tang H. [1 ,2 ]
Liu G. [1 ,2 ,3 ]
Guo W. [1 ,2 ,3 ]
Chen G. [1 ,2 ]
机构：
[1] College of Mathematics and Computer Sciences, Fuzhou University, Fuzhou
[2] Key Laboratory of Networking Computing and Intelligent Information Processing, Fujian Province, Fuzhou University, Fuzhou
[3] Key Laboratory of Spatial Data Mining and Information Sharing, Ministry of Education, Fuzhou University, Fuzhou
来源：
Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence | 2020年 / 33卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Corner Point Selection; Particle Swarm Optimization; Refinement Strategy; Steiner Minimum Tree; X-architecture Routing;
D O I：
10.16451/j.cnki.issn1003-6059.202005003
中图分类号：
学科分类号：
摘要：
To further study X-architecture and make full use of routing resources within the obstacle, an X-architecture Steiner minimum tree algorithm considering routing resource relaxation is proposed in this paper. Firstly, crossover and mutation operators are introduced in the update operation of particles to solve the discretization problem. Secondly, look-up tables are presented for the whole algorithm process to provide a fast information query. Thirdly, a corner point selection strategy is proposed to introduce some obstacle corner points and satisfy the constraints. Finally, a refinement strategy is implemented to further improve the quality of the final routing tree. Experimental results show that the proposed algorithm makes full use of the routing resources within the obstacle, shortens the total wirelength effectively and achieves a better total wirelength. © 2020, Science Press. All right reserved.
引用
收藏
页码：401 / 412
页数：11
相关论文
共 35 条
  • [1] LIU G G, GUO W Z, CHEN G L., VLSI Multilayer Obstacle-Avoiding Steiner Minimal Tree Construction Algorithms in X-architecture, Journal of Computer-Aided Design and Computer Graphics, 27, 3, pp. 523-532, (2015)
  • [2] BORAH M, OWENS R M, IRWIN M J., An Edge-Based Heuristic for Steiner Routing, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13, 12, pp. 1563-1568, (1994)
  • [3] ZHOU H., Efficient Steiner Tree Construction Based on Spanning Graphs, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 23, 5, pp. 704-710, (2004)
  • [4] CINEL S, BAZLAMACCI C F., A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27, 11, pp. 2083-2087, (2008)
  • [5] KAHNG A B, MANDOIU I I, ZELIKOVSKY A Z., Highly Scalable Algorithms for Rectilinear and Octilinear Steiner Trees, Proc of the Asia and South Pacific Design Automation Conference, pp. 827-833, (2003)
  • [6] CHU C, WONG Y C., 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, pp. 70-83, (2008)
  • [7] VANI V, PRASAD G R., Augmented Line Segment Based Algorithm for Constructing Rectilinear Steiner Minimum Tree, Proc of the International Conference on Communication and Electronics Systems, (2016)
  • [8] NAIR L R, PRASAD G R., Wirelength and Memory Optimized Rectilinear Steiner Minimum Tree Routing, Proc of the 2nd IEEE International Conference on Recent Trends in Electronics, Information and Communication Technology, pp. 1493-1497, (2017)
  • [9] TU P, CHOW W K, YOUNG E F Y, Timing Driven Routing Tree Construction, Proc of the ACM/IEEE International Workshop on System Level Interconnect Prediction, (2017)
  • [10] YAN J T., Timing-Driven Octilinear Steiner Tree Construction Ba-sed on Steiner-Point Reassignment and Path Reconstruction, ACM Transactions on Design Automation of Electronic Systems, 13, 2, (2008)
1234