lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity
文献类型：期刊论文
| 作者 | Jing, Tom Tong; Feng, Zhe; Hu, Yu; Hong, Xianlong L.; Hu, Xiaodong D. ; Yan, Guiying Y.
|
| 刊名 | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
 |
| 出版日期 | 2007-11-01 |
| 卷号 | 26期号:11页码:2073-2079 |
| 关键词 | Index Terms-Physical design routing Steiner tree very large scale integration (VLSI). |
| ISSN号 | 0278-0070 |
| 英文摘要 | Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is an essential part of routing. Recently, IC routing and related researches have been extended from Manhattan architecture (gimel(2)-geometry) to Y-/X-architecture (gimel 3 -/gimel 4-geometry) to improve the chip performance. This paper presents an O(n log n) heuristic, X-OAT, for obstacle-avoiding Steiner minimal tree construction in the X-geometry plane (gimel-OASMT). In this paper, based on obstacle-avoiding constrained Delaunay triangulation, a full connected tree is constructed and then embedded into gimel-OASMT by zonal combination. To the best of our knowledge, this is the first work addressing the gimel-OASMT problem. Compared with most recent works on OARSMT problem, X-OAT obtains up to 30-Kx speedup with quality solution. We have tested randomly generated cases with up to 10 K terminals and 10-K rectilinear obstacles within 4 seconds on a Sun V880 workstation (755-MHz CPU and 4-GB memory). The high efficiency and accuracy of X-OAT make it extremely practical and useful in the routing phase. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:000250415500015 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/4468]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Jing, Tom Tong |
| 作者单位 | 1.Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China 2.Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA 3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Jing, Tom Tong,Feng, Zhe,Hu, Yu,et al. lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,2007,26(11):2073-2079. |
| APA | Jing, Tom Tong,Feng, Zhe,Hu, Yu,Hong, Xianlong L.,Hu, Xiaodong D.,&Yan, Guiying Y..(2007).lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity.IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,26(11),2073-2079. |
| MLA | Jing, Tom Tong,et al."lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity".IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 26.11(2007):2073-2079. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。