Codar: a congestion-directed general area router

A general area router that integrates the phases of global routing and detailed routing has been developed. The global phase coarsely places the nets based on the congestion of the routing region, and the detailed phase modifies the course wiring to find legal positions for all wire segments. Both phases use the same grid space of routing tracks with two or more levels of interconnect. With this integrated data structure, the router can alternate between global and detailed routing operations, both of which use rip-up and reroute techniques. This integration has resulted in a router that can solve difficult problems not solvable by other programs while exhibiting runtimes that grow only moderately with the size of the routing problem.<<ETX>>

[1]  Alberto L. Sangiovanni-Vincentelli,et al.  A New Symbolic Channel Router: YACR2 , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[3]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[4]  Tetsuo Asano,et al.  Routing Region Definition and Ordering Scheme for Building-Block Layout , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  W. K. Luk,et al.  A greedy switch-box router , 1985, Integr..

[6]  Alberto Sangiovanni-Vincentelli,et al.  Mighty: a rip-up and reroute detailed router , 1986 .

[7]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[8]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.