Modern large-scale circuit designs have created great demand for fast and high-quality global routing algorithms to resolve the\r\nrouting congestion at the global level. Rip-up and reroute scheme has been employed by the majority of academic and industrial\r\nglobal routers today, which iteratively resolve the congestion by recreating the routing path based on current congestion. This\r\nmethod is proved to be the most practical routing framework. However, the traditional iterative maze routing technique converges\r\nvery slowly and easily gets stuck at local optimal solutions. In this work, we propose a very efficient and high-quality global\r\nrouterââ?¬â?FastRoute. FastRoute integrates several novel techniques: fast congestion-driven via-aware Steiner tree construction, 3-\r\nbend routing, virtual capacity adjustment, multisource multi-sink maze routing, and spiral layer assignment. These techniques\r\nnot only address the routing congestion measured at the edges of global routing grids but also minimize the total wirelength\r\nand via usage, which is critical for subsequent detailed routing, yield, and manufacturability. Experimental results show that\r\nFastRoute is highly effective and efficient to solve ISPD07 and ISPD08 global routing benchmark suites. The results outperform\r\nrecently published academic global routers in both routability and runtime. In particular, for ISPD07 and ISPD08 global routing\r\nbenchmarks, FastRoute generates 12 congestion-free solutions out of 16 benchmarks with a speed significantly faster than other\r\nrouters.
Loading....