Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A channel/switchbox definition algorithm for building-block layout
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
VLSI floorplan generation and area optimization using AND-OR graph search
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
The Differencing Method of Set Partitioning
The Differencing Method of Set Partitioning
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
We identify a new problem called geometric bipartitioning that is useful in VLSI layout design. Given a floorplan with rectilinear modules, the problem is to partition the floor by a staircase (monotone increasing) channel from one corner of the floor to its diagonally opposite corner, such that the numbers of modules in the two halves become equal. As the partition is heavily dependent on the geometry of the floorplan, this is quite different from the classical graph bisection problem. This problem can be captured using a weighted permutation graph with integer edge weights, which may be positive, negative or zero; the goal is to find a path between two designated nodes such that the absolute value of the sum of edge weights along the path is minimum. We then show that this problem is NP-complete, and present a heuristic algorithm based on branch-and-bound. Experimental results with benchmarks and randomly generated floorplans reveal that the algorithm produces optimal results quickly most of the time. Geometric bipartitioning problem may find many applications to hierarchical decomposition, floorplanning, and routing.