A Contraction-based Ratio-cut Partitioning Algorithm
TL;DR: This paper describes a new simple ratio-cut partitioning algorithm using node contraction that combines iterative improvement with progressive cluster formation and runs in linear time.
read more
Abstract: Partitioning is a fundamental problem in the design of VLSI circuits. In recent years, ratio-cut partitioning has received attention due to its tendency to partition circuits into their natural clusters. Node contraction has also been shown to enhance the performance of iterative partitioning algorithms. This paper describes a new simple ratio-cut partitioning algorithm using node contraction. This new algorithm combines iterative improvement with progressive cluster formation. Under suitably mild assumptions, the new algorithm runs in linear time. It is also shown that the new algorithm compares favorably with previous approaches.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
High-Quality Hypergraph Partitioning
Sebastian Schlag,Tobias Heuer,Lars Gottesbüren,Yaroslav Akhremtsev,Christian Schulz,Peter Sanders +5 more
TL;DR: KaHyPar, already without the memetic component, computes better solutions than all competing algorithms for both the cut-net and the connectivity metric, while being faster than Zoltan-AlgD and equally fast as hMETIS.
•Journal Article
Comparison of Computational Requirements of Spectral and Kernel k-means Bisectioning of Power systems
Ali Peiravi,Rahim Ildarabadi +1 more
TL;DR: A review of the potential applications of graph partitioning is presented and the classical and the newer spectral and multilevel k-means approaches to solving these problems for power system islanding are described.
•Journal Article
An efficient A* algorithm for the directed linear arrangement problem
TL;DR: A hybrid DC+BDS algorithm is developed to approximate the optimal linear arrangement solution, which includes directed clustering and bidirectional sort technique, and this approximation solution is used as an upper bound to prune the state space during the A* search.
2
References
A Linear-Time Heuristic for Improving Network Partitions
Charles M. Fiduccia,R. M. Mattheyses +1 more
- 01 Jan 1982
TL;DR: An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network.
2.5K
Fast spectral methods for ratio cut partitioning and clustering
L. Hagen,Andrew B. Kahng +1 more
- 01 Jan 1991
TL;DR: It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost.
Multilevel hypergraph partitioning: application in VLSI domain
George Karypis,Rajat Aggarwal,Vipin Kumar,Shashi Shekhar +3 more
- 13 Jun 1997
TL;DR: The experiments show that the multilevel hypergraph partitioning algorithm produces high quality partitioning in relatively small amount of time and outperforms other schemes (in hyperedge cut) quite consistently with larger margins.
Hierarchical partitioning
Dirk Behrens,Klaus Harbich,Erich Barke +2 more
- 01 Jan 1996
TL;DR: The approach presented in this paper uses information on design hierarchy in order to improve partitioning results and reduce problem complexity.
793
Recent directions in netlist partitioning: a survey
TL;DR: This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches, and discusses methods which combine clustering with existing algorithms (e.g., two-phase partitioning).
703
Related Papers (5)
Yen-Chuen Arthur Wei,Chung-Kuan Cheng +1 more
- 01 Jan 1990
W.-P. Yang,J.-S. Ker,Y.-H. Kuo,Y.-K. Ho +3 more
- 01 Jun 1994