Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach

被引:19
|
作者
Chow, Wing-Kai [1 ]
Li, Liang [1 ]
Young, Evangeline F. Y. [1 ]
Sham, Chiu-Wing [2 ]
机构
[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
[2] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong Kong, Hong Kong, Peoples R China
关键词
Obstacle-avoiding maze routing; GPU; Parallel computing; ALGORITHM;
D O I
10.1016/j.vlsi.2013.08.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Rectilinear Steiner Minimum Tree (RSMT) problem is a fundamental one in VLSI physical design. In this paper, we present a maze routing based heuristics to solve the obstacle-avoiding RSMT (OARSMT) problem. Our approach can handle multi-pin nets in good quality and reasonable running time. We also present an implementation of the heuristics in parallel approach with the aid of graphic processing units (GPU). The parallel algorithm is implemented by using CUDA and has been tested on a NVIDIA graphic card. Our experimental results show that our parallel algorithm has promising speedups over our sequential approach. This work demonstrates that we can apply a parallel algorithm to solve the OARSMT problem with the aid of GPU. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:105 / 114
页数:10
相关论文
共 50 条
  • [31] Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction
    Zhang, Hao
    Ye, Dong-Yi
    NEURAL COMPUTING & APPLICATIONS, 2015, 26 (04): : 875 - 898
  • [32] Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction
    Hao Zhang
    Dong-Yi Ye
    Neural Computing and Applications, 2015, 26 : 875 - 898
  • [33] VLSI multilayer obstacle-avoiding Steiner minimal tree construction algorithms in X-architecture
    Liu, Genggeng
    Guo, Wenzhong
    Chen, Guolong
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2015, 27 (03): : 523 - 532
  • [34] Electromigration- and Obstacle-Avoiding Routing Tree Construction
    Tsai, Yun-Chih
    Li, Tai-Hung
    Chen, Tai-Chen
    Yeh, Chung-Wei
    2013 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), 2013,
  • [35] Electromigration- and Obstacle-Avoiding Routing Tree Construction
    Tsai, Yun-Chih
    Li, Tai-Hung
    Chen, Tai-Chen
    Yeh, Chung-Wei
    2013 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), 2013,
  • [36] Critical-Trunk-Based Obstacle-Avoiding Rectilinear Steiner Tree Routings and Buffer Insertion for Delay and Slack Optimization
    Lin, Yen-Hung
    Chang, Shu-Hsin
    Li, Yih-Lang
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2011, 30 (09) : 1335 - 1348
  • [37] A Maze Routing-Based Methodology With Bounded Exploration and Path-Assessed Retracing for Constrained Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction
    Lin, Kuen-Wey
    Lin, Yeh-Sheng
    Li, Yih-Lang
    Lin, Rung-Bin
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2018, 23 (04)
  • [38] Efficient Multilayer Routing Based on Obstacle-Avoiding Preferred Direction Steiner Tree
    Liu, Chih-Hung
    Chou, Yao-Hsin
    Yuan, Shih-Yi
    Kuo, Sy-Yen
    ISPD'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, 2008, : 118 - +
  • [39] 3-Step Rectilinear Minimum Spanning Tree Construction for Obstacle-Avoiding Component-to-Component Routing
    Wuerges, Emilio
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (12) : 5123 - 5127
  • [40] MLXR: multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing
    Huang, Xing
    Guo, Wenzhong
    Liu, Genggeng
    Chen, Guolong
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (01)