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
来源：
INTEGRATION-THE VLSI JOURNAL | 2014年 / 47卷 / 01期
关键词：
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 条
  • [21] EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm
    Long, Jieyi
    Zhou, Hai
    Memik, Seda Ogrenci
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2008, 27 (12) : 2169 - 2182
  • [22] Efficient Multi-Layer Obstacle-Avoiding Region-to-Region Rectilinear Steiner Tree Construction
    Wang, Run-Yi
    Pai, Chia-Cheng
    Wang, Jun-Jie
    Wen, Hsiang-Ting
    Pai, Yu-Cheng
    Chang, Yao-Wen
    Li, James C. M.
    Jiang, Jie-Hong
    2018 55TH ACM/ESDA/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2018,
  • [23] An O(n log n) Path-Based Obstacle-Avoiding Algorithm for Rectilinear Steiner Tree Construction
    Liu, Chih-Hung
    Yuan, Shih-Yi
    Kuo, Sy-Yen
    Chou, Yao-Hsin
    DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2009, : 314 - +
  • [24] Guiding Solution Based Local Search for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Problem
    Zhang, Tiancheng
    Lu, Zhipeng
    Ding, Junwen
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, 8 (01): : 440 - 453
  • [25] A full-scale solution to the rectilinear obstacle-avoiding Steiner problem
    Jing, Tom Tong
    Hu, Yu
    Feng, Zhe
    Hong, Xian-Long
    Hu, Xiaodong
    Yan, Guiying
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (03) : 413 - 425
  • [26] Obstacle-Avoiding Octagonal Steiner Tree Construction Based on Particle Swarm Optimization
    Huang, Xing
    Liu, Genggeng
    Guo, Wenzhong
    Chen, Guolong
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 539 - 543
  • [27] Obstacle-avoiding rectilinear minimum-delay steiner tree construction towards IP-block-based SOC design
    Xu, JY
    Hong, XL
    Jing, T
    Yang, Y
    6TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN, PROCEEDINGS, 2005, : 616 - 621
  • [28] Critical-Trunk Based Obstacle-Avoiding Rectilinear Steiner Tree Routings for Delay and Slack Optimization
    Lin, Yen-Hung
    Chang, Shu-Hsin
    Li, Yih-Lang
    ISPD 2009 ACM INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, 2009, : 151 - 158
  • [29] Obstacle-avoiding rectilinear minimum-delay Steiner tree construction toward IP-block-based SOC design
    Xu, JY
    Hong, XL
    Jing, T
    Yang, Y
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2006, 53 (04) : 309 - 313
  • [30] Fast Obstacle-Avoiding Octilinear Steiner Minimal Tree Construction Algorithm for VLSI Design
    Huang, Xing
    Guo, Wenzhong
    Chen, Guolong
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2015), 2015, : 46 - 50
12345