文章基本信息

标题：Obstacle-Avoiding Rectilinear Steiner Minimum Tree: A Survey
本地全文：下载
作者：Arpana Bhagwat
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：4
DOI：10.15680/ijircce.2015.0304185
出版社：S&S Publications
摘要：Rectilinear Steiner Minimum Tree (RSMT) is one of the global routing techniques in VLSI design, wherethe tree spans a given set of pins by reaching each of them either vertically or horizontally.While constructing suchRSMTs, there can be many obstacles.There are many research works done in order to construct RSMTs which aredevoidof obstacles. Some of the recent research works are considered in this paper to understand the problem and to learn theavailable solutions.It covers and compares different approaches and methodologies which are used to find OARSMT.Some of the different approaches discussed here are Geo-Steiner approach, Maze routing method, Top-downpartitioning approach and Greedy heuristic method.Comparison of these algorithms in accordance with their speed,efficiency, resources used and other pros and cons are also listed as a part of this work. A table listing the experimentalresults ismadeto realize the actual performance of different algorithms.
关键词：Rectilinear Steiner Minimum Tree; Obstacles; Slew Constraint