SILK: a simulated evolution router

The authors present a rip-up-and-rerouter based on a matrix representation scheme and simulated evolution technique for solving detailed routing problems in VLSI layout. The status of the routing region is represented as a matrix. Rip-up and reroute operations are emulated as matrix subtractions and additions, respectively. The quality of a routing result can be measured by a few simple matrix operations on the matrix. A rip-up and reroute switch-box/channel router, called SILK, using a simulated evolution technique has been implemented based on this representation alone. Experimental results showed that SILK, when solving all the benchmarks from the literature, outperformed WEAVER, the most successful switch-box router to date, in both quality and speed aspects. >

[1]  R. K. McGehee.  A Practical Moat Router , 1987, 24th ACM/IEEE Design Automation Conference.

[2]  Hon Wai Leong,et al.  SIMULATED-ANNEALING CHANNEL ROUTER. , 1985 .

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

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

[5]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[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]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[8]  Masayoshi Tachibana,et al.  A Hardware Maze Router with Application to Interactive Rip-Up and Reroute , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  H. H. Chen.  Routing L-Shaped Channels in Nonslicing-Structure Placement , 1987, 24th ACM/IEEE Design Automation Conference.

[10]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.

[11]  Takeshi Yoshimura.  An Efficient Channel Router , 1984, 21st Design Automation Conference Proceedings.

[12]  Yu-Chin Hsu,et al.  A new global router for ASIC design based on simulated evolution , 1989, International Symposium on VLSI Technology, Systems and Applications,.

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

[14]  Michael Burstein,et al.  Hierarchical Channel Router , 1983, 20th Design Automation Conference Proceedings.

[15]  Chi-Ping Hsu,et al.  General River Routing Algorithm , 1983, 20th Design Automation Conference Proceedings.

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

[17]  Prithviraj Banerjee,et al.  ESP: A New Standard Cell Placement Package Using Simulated Evolution , 1987, 24th ACM/IEEE Design Automation Conference.

[18]  J. Soukup.  Circuit layout , 1981, Proceedings of the IEEE.