VLSI circuit partitioning by cluster-removal using iterative improvement techniques
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
When clusters meet partitions: new density-based methods for circuit decomposition
EDTC '95 Proceedings of the 1995 European conference on Design and Test
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
We present an efficient heuristic for finding good bipartitioning of the vertex set of a hypergraph, which respects the dense clusters inside. In a hypergraph modeling a VLSI netlist, these dense clusters typically correspond to dense combinational blocks and are better kept intact for some obvious VLSI design benefits. Our approach to identify the dense clusters is based on the theory of submodular functions. Once these clusters are identified, we make use of FM algorithm to get a good bipartition, providing some hints to FM to keep these clusters intact. This approach not only respects the natural clusters, but also produces bipartitions with better net-cut in quite a few cases. Hence, we propose that this approach can be used as an alternate strategy to find a good bipartition, which respects the dense clusters.