QQ客服 官方微博 反馈留言

	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
	2010-05-06 ; 2010-05-06
关键词	routing rectilinear Steiner minimal tree obstacle avoiding ant colony optimization track graph hypergraph full Steiner tree detour PATH CONNECTION ALGORITHM SHORTEST PATHS GRAPHS TREES Computer Science, Hardware & Architecture Engineering, Electrical & Electronic
中文摘要	Routing is one of the important steps in very/ultra large-scale integration (VLSI/ULSI) physical design. Rectilinear Steiner minimal tree (RSMT) construction is an essential part of routing. Macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in the routing phase. Obstacle-avoiding RSMT (OARSMT) algorithms are useful for practical routing applications. However, OARSMT algorithms for multi-terminal net routing still cannot meet the requirements of practical applications. This paper focuses on the OARSMT problem and gives a solution to full-scale nets based on two algorithms, namely An-OARSMan and FORSTer. (1) Based on ant colony optimization (ACO), An-OARSMan can be used for common scale nets with less than 100 terminals in a circuit. An heuristic, greedy obstacle penalty distance (OP-distance), is used in the algorithm and performed on the track graph. (2) FORSTer is a three-step heuristic used for large-scale nets with more than 100 terminals in a circuit. In Step 1, it first partitions all terminals into some subsets in the presence of obstacles. In Step 2, it then connects terminals in each connected graph with one or more trees, respectively. In Step 3, it finally connects the forest consisting of trees constructed in Step 2 into a complete Steiner tree spanning all terminals while avoiding all obstacles. (3) These two graph-based algorithms have been implemented and tested on different kinds of cases. Experimental results show that An-OARSMan can handle both convex and concave polygon obstacles with short wire length. It achieves the optimal solution in the cases with no more than seven terminals. The experimental results also show that FORSTer has short running time, which is suitable for routing large-scale nets among obstacles, even for routing a net with one thousand terminals in the presence of 100 rectangular obstacles. (C) 2007 Elsevier B.V. All rights reserved.
语种	英语 ; 英语
出版者	ELSEVIER SCIENCE BV ; AMSTERDAM ; PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9998]
专题	清华大学
推荐引用方式 GB/T 7714	Jing, Tom Tong,Hu, Yu,Feng, Zhe,et al. A full-scale solution to the rectilinear obstacle-avoiding Steiner problem[J],2010, 2010.
APA	Jing, Tom Tong,Hu, Yu,Feng, Zhe,Hong, Xian-Long,Hu, Xiaodong,&Yan, Guiying.(2010).A full-scale solution to the rectilinear obstacle-avoiding Steiner problem..
MLA	Jing, Tom Tong,et al."A full-scale solution to the rectilinear obstacle-avoiding Steiner problem".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。