Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A new approach to effective circuit clustering
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Geometric embeddings for faster and better multi-way netlist partitioning
DAC '93 Proceedings of the 30th international Design Automation Conference
Spectral partitioning: the more eigenvectors, the better
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
| Hi-index | 0.00 |
r-way partitioning is an NP-hard problem. In this paper we present a few heuristics for clustering, which are motivated by the theory of sub/supermodular functions. The implementation based on this heuristic justifies some already published results about the approximability of the optimal solutions to this NP-hard problem using the ideas from the theory of sub/supermodular-functions. We also suggest a hypergraph model which is more natural and more suitable for modeling this problem. We give some experimental results which indicate that our methods hold promise. Our experimental results are comparable, and in some cases better than the best to date spectral partitioning methods on the standard benchmark circuits. Finally we suggest some multilevel strategies for partitioning, where in each level we employ a supermodular function based strategy which gives a suboptimal partitioning on the fused supergraph.