A new multi-layer global routing flow for congestion elimination
暂无分享,去创建一个
With the progress of very large scale integration, using traditional global routing algorithms to solve multi-layer routing problem causes the routing resource waste of lower layers or the lack of higher layers because the pitch size is different in different layer pairs and traditional algorithms use uniform pitch size for all layer pairs. The paper presents a global routing algorithm that performs layer assignment before routing. This algorithm is based on a new flow for multi-layer routing, and uses bounding box of the nets to estimate the congestion, and distributes them to different layer pairs based on the aim of even congestion. The algorithm has been implemented and tested. The experimental results show that the algorithm is more effective.
[1] Lei He,et al. A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem , 2005, ASP-DAC '05.
[2] Electronics Letters , 1965, Nature.
[3] Chong-Min Kyung,et al. ANALYTIC APPROACH TO THREE LAYER CHANNEL ROUTING , 1992 .
[4] Jun Gu,et al. SSTT: Efficient local search for GSI global routing , 2003, Journal of Computer Science and Technology.