NEMO: A new implicit connection graph-based gridless router with multi-layer planes and pseudo-tile propagation

Hsin Yu Chen*, Yih-Lang Li, Zhi Da Lin

*此作品的通信作者

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

This study presents a new multilayer implicit connection graph-based gridless router called NEMO. Unlike the first implicit connection graph-based router that embeds all routing layers onto a routing plane, NEMO constructs a routing plane for each routing layer. Furthermore, each routing plane is composed of tiles, not an array of grid points as well as their connecting edges, and, consequently, the complexity of routing problem decreases. Each grid then exactly represents one tile (its left bottom corner), and grid maze becomes tile propagation; moreover, to further speedup in path searching, continuous space tiles are combined as a pseudo maximum horizontally or vertically stripped tile. Experimental results indicate that NEMO conducts point-to-point path searching on about 10 times faster than the implicit connection graph-based router. Full-chip routing by NEMO also outperforms all multi-level gridless routers with about 1.45X to 2.42X runtime speedups.

原文English
主出版物標題Proceedings of ISPD'06 - 2006 International Symposium on Physical Design
頁面64-71
頁數8
DOIs
出版狀態Published - 20 7月 2006
事件ISPD'06 - 2006 International Symposium on Physical Design - San Jose, CA, United States
持續時間: 9 4月 200612 4月 2006

出版系列

名字Proceedings of the International Symposium on Physical Design
2006

Conference

ConferenceISPD'06 - 2006 International Symposium on Physical Design
國家/地區United States
城市San Jose, CA
期間9/04/0612/04/06

指紋

深入研究「NEMO: A new implicit connection graph-based gridless router with multi-layer planes and pseudo-tile propagation」主題。共同形成了獨特的指紋。

引用此