A general multi-layer area router

This paper presents a general multi-layer area router based on a novel grid construction scheme. The grid construction scheme produces more wiring tracks than the normal uniform grid scheme and accounts for differing design rules of the layers involved. Initial routing performed on the varying capacity grid is followed by a layer assignment stage. Routing completion is ensured by iterating local and global modifications in the layer assignment stage. Our router has been incorporated into the Custom Cell Synthesis project at MCC and has shown improved results for cell synthesis problems when compared with the router Mighty which was used in earlier versions of the project.

[1]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

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

[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]  C. Y. Lee An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[6]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1985, DAC 1985.

[7]  Carlo H. Séquin,et al.  Codar: a congestion-directed general area router , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[8]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1985, IEEE Design & Test of Computers.

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