The crossing distribution problem [IC layout]

In this paper we study the problem of "properly" distributing the set of crossings (i.e., intersection of nets), of a given global routing, among the regions. Each region is assigned a quota, being the maximum number of crossings allowed in that region, which depends on its area and its complexity (e.g., the number of wets going through it and the number of terminals it contains). The crossing distribution problem (CDP) is to find a net ordering at each boundary as to minimize the total number of crossings and to satisfy the quotas. We propose an O(mn/sup 2/+m/spl xi//sup 3/2/) time algorithm for CDP, where m is the number of modules, n is the number of nets, and /spl xi/ is the number of crossings. >

[1]  Ron Y. Pinter,et al.  Optimal Routing in Rectilinear Channels , 1981 .

[2]  Majid Sarrafzadeh,et al.  A new approach to topological via minimization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  William S. Carter,et al.  Third-generation architecture boosts speed and density of field-programmable gate arrays , 1990, IEEE Proceedings of the Custom Integrated Circuits Conference.

[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]  T. Ohtsuki,et al.  Layout design and verification , 1986 .

[6]  Chak-Kuen Wong,et al.  Global routing based on Steiner min-max trees , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  P. Groeneveld,et al.  On Global Wire Ordering for Macro-Cell Routing , 1989, 26th ACM/IEEE Design Automation Conference.