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 条

[41] FH-OAOS: A Fast Four-Step Heuristic for Obstacle-Avoiding Octilinear Steiner Tree Construction
Huang, Xing
Guo, Wenzhong
Liu, Genggeng
Chen, Guolong
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2016, 21 (03)
[42] MLXR: multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing
Xing HUANG
Wenzhong GUO
Genggeng LIU
Guolong CHEN
Science China(Information Sciences), 2017, 60 (01) : 211 - 213
[43] Multilayer Obstacle-Avoiding X-Architecture Steiner Minimal Tree Construction Based on Particle Swarm Optimization
Liu, Genggeng
Huang, Xing
Guo, Wenzhong
Niu, Yuzhen
Chen, Guolong
IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (05) : 989 - 1002
[44] Obstacle Avoiding Rectilinear Clock Tree Construction with Skew Minimization
Saha, Partha Pratim
Samanta, Tuhina
2014 27TH INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2014 13TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID 2014), 2014, : 387 - 392
[45] Corner-Stitching-Based Multilayer Obstacle-Avoiding Component-to-Component Rectilinear Minimum Spanning Tree Construction
Su, Yen-Yu
Wang, Shuo-Hui
Wu, Wei-Liang
Lin, Mark Po-Hung
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (03) : 675 - 685
[46] Obstacle-Avoiding Connectivity Restoration Based on Quadrilateral Steiner Tree in Disjoint Wireless Sensor Networks
Chen, Bo
Chen, Hongsheng
Wu, Chunhui
IEEE ACCESS, 2019, 7 : 124116 - 124127
[47] Obstacle-avoiding euclidean Steiner trees in the plane: An exact algorithm
Zachariasen, M
Winter, P
ALGORITHM ENGINEERING AND EXPERIMENTATION, 1999, 1619 : 282 - 295
[48] An-OARSMan: Obstacle-avoiding routing tree construction with good length performance
Hu, Yu
Jing, Tong
Hong, Xianlong
Feng, Zhe
Hu, Xiaodong
Yan, Guiying
ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2005, : 7 - 12
[49] Efficient Rectilinear Steiner Tree construction with Rectilinear Blockages
Shen, Z
Chu, CCN
Li, YM
2005 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS, 2005, : 38 - 44
[50] Obstacle-Avoiding Euclidean Steiner Trees by n-Star Bundles
Parque, Victor
Miyashita, Tomoyuki
2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2018, : 315 - 319

← 1 2 3 4 5 →