Heuristic strategies for switchbox routing in VLSI design

A two-layer symbolic router is proposed which is able to route very dense switchbox problems successfully. The heuristics on which the routing program is based emulate the approach followed by expert designers in manual routing. First, the most promising connections are looked for, without affecting the wireability of more complex connections. Secondly, in crowded situations, blocking nets are identified and alternative solutions are tied through rip-up and rerouting steps. These heuristics greatly extend the space for searching the solution, thus markedly increasing its rate of success.<<ETX>>

[1]  Alberto L. Sangiovanni-Vincentelli,et al.  A Detailed Router Based on Incremental Routing Modifications: Mighty , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Malgorzata Marek-Sadowska.  Two-Dimensional Router for Double Layer Layout , 1985, DAC 1985.

[3]  Richard J. Enbody,et al.  General Purpose Router , 1987, 24th ACM/IEEE Design Automation Conference.

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

[5]  R. Otten.  Automatic Floorplan Design , 1982, DAC 1982.

[6]  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.

[7]  T. Ohtsuki,et al.  Layout design and verification , 1986 .

[8]  Rostam Joobbani,et al.  Artificial Intelligence Approach to VLSI Routing , 1985 .

[9]  James P. Cohoon,et al.  BEAVER: a computational-geometry-based tool for switchbox routing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..