標題: NEMO: A new implicit-connection-graph-based gridless router with multilayer planes and pseudo tile propagation
作者: Li, Yih-Lang
Chen, Hsin-Yu
Lin, Chih-Ta
交大名義發表
National Chiao Tung University
關鍵字: physical design;routing
公開日期: 1-四月-2007
摘要: The implicit-connection-graph-based router is superior to the tile-based router in terms of routing graph construction and point querying. However, the implicit connection graph has a higher degree of routing graph complexity. In this paper, a new multilayer implicit-connection-graph-based gridless router called NEMO is developed. Unlike the first implicit-connectiongraph-based router that embeds all routing layers onto a routing plane, NEMO constructs a routing plane for each routing layer. Additionally, each routing plane comprises tiles, not an array of grid points with their connecting edges, and consequently, the complexity of the routing problem decreases. Each grid point then represents exactly one tile or its left-bottom corner such that a tile query is equivalent to any point query inside the queried tile, and a grid maze becomes tile propagation. Furthermore, to accelerate path search, continuous space tiles are combined as a pseudo maximum horizontally or vertically stripped tile. Experimental results reveal that NEMO conducts a point-to-point path search around ten times faster than the implicit-connection-graph-based router. General-purpose routing by NEMO also improves routing performance by approximately 1.69x-55.82x, as compared to previously published works based on a set of commonly used MCNC benchmark circuits.
URI: http://dx.doi.org/10.1109/TCAD.2007.891381
http://hdl.handle.net/11536/4906
ISSN: 0278-0070
DOI: 10.1109/TCAD.2007.891381
期刊: IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
Volume: 26
Issue: 4
起始頁: 705
結束頁: 718
顯示於類別:會議論文


文件中的檔案:

  1. 000245190500009.pdf