Download:
|
by Charles J. Alpert, Jen-hsin Huang, Andrew B. Kahng
http://ballade.cs.ucla.edu:8080/~cheese/papers/multilevelDAC.ps
Add To MetaCart
Abstract:
multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance until its size is smaller than a given threshold, then unclusters the instance while applying a partitioning refinement algorithm. Our multilevel partitioner uses a new technique to control the number of levels in the matchingbased clustering phase and also exploits recent innovations in classic iterative partitioning [7] [10]. Our heuristic outperforms numerous existing bipartitioning heuristics, with improvements ranging from 6.9 to 27.9 % for 100 runs and 3.0 to 20.6 % for just 10 runs (while also using less CPU time). 1
Citations
|
341
|
A multilevel algorithm for partitioning graphs
– Hendrickson, Leland
- 1995
|
|
260
|
Mattheyses, “A linear time heuristic for improving network partitions
– Fiduccia, M
- 1982
|
|
170
|
Recent directions in netlist partitioning: A survey
– Alpert, Kahng
- 1995
|
|
112
|
An improved min-cut algorithm for partitioning VLSI networks
– Krishnamurthy
- 1984
|
|
57
|
An evaluation of bipartitioning technique
– Hauck, Borriello
- 1995
|
|
56
|
A Parallel Bottom-up Clustering Algorithm with Applications to Circuits Partitioning
– Cong, Smith
- 1993
|
|
55
|
VLSI circuit partitioning by cluster-removal using iterative improvement techniques
– Dutt, Deng
- 1996
|
|
52
|
Improving the performance of the kernighan-lin and simulated annealing graph bisection algorithm
– Bui
- 1989
|
|
41
|
A hybrid multilevel/genetic approach for circuit partitioning
– Alpert, Kahng
- 1996
|
|
40
|
Partitioning-Based Standard-Cell Global Placement with an Exact Objective
– Huang, Kahng
- 1997
|
|
39
|
Partitioning very large circuits using analytical placement techniques
– Riess, Doll, et al.
- 1994
|
|
37
|
Probability-Based Approaches to VLSI Circuit Partitioning
– Dutt, Deng
|
|
27
|
On Implementation Choices for Iterative Improvement Partitioning Algorithms
– Hagen, Huang, et al.
- 1995
|
|
17
|
Linear decomposition algorithm for VLSI design applications
– Li, Lillis, et al.
- 1995
|
|
15
|
Multilevel graph partitioning schemes
– Karypis, Kumar
- 1995
|
|
10
|
Multi-way graph and hypergraph partitioning
– Alpert
- 1996
|
|
6
|
Graph Contraction for Mapping Data on Parallel Computers: A QualityCost Tradeoff
– Ponnusamy, Mansour, et al.
- 1994
|
|
5
|
Linear Decomposition Algorithm for
– Li, Lillis, et al.
- 1995
|
|
3
|
Large-Step Markov Chain Variants for VLSI Netlist Partitioning
– Fukunaga, Huang, et al.
- 1996
|
|
2
|
Kahng "Partitioning-Based StandardCell Global Placement with An Exact Objective
– Huang, B
- 1997
|
|
1
|
A Probability-Based Approach to
– Dutt, Deng
- 1996
|
