Area(number)-balanced hierarchy of staircase channels with minimum crossing nets

We address the problem of hierarchically partitioning a VLSI floorplan F using monotone staircase channels to aid global routing. Our problem is to identify a monotone staircase channel (ms-cut) from one corner of F to its opposite corner, such that (i) the number of nets crossing the ms-cut is minimized, and (ii) the area (or the number of the blocks) of both the partitions are nearly equal. The problem is shown to be NP-hard, and a maxflow-based heuristic is proposed.

[1]  Martin D. F. Wong,et al.  Channel routing order for building-block layout with rectilinear modules , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[2]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD '94.

[3]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[4]  D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.

[5]  B.B. Bhattacharya,et al.  Routing of L-shaped channels, switchboxes and staircases in Manhattan-diagonal model , 1998, Proceedings Eleventh International Conference on VLSI Design.

[6]  Subhas C. Nandy,et al.  Partitioning VLSI floorplans by staircase channels for global routing , 1998, Proceedings Eleventh International Conference on VLSI Design.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Surendra Burman.  Improved Global Routing Using ⋋-Geometry , 1992 .