Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal

Volumn 19, Issue 1-2, 1995, Pages 1-81

  Alpert, Charles J ^a   Kahng, Andrew B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; CONSTRAINT THEORY; INTEGRATED CIRCUIT LAYOUT; ITERATIVE METHODS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; MINIMIZATION OF SWITCHING NETS; SIMULATED ANNEALING; VECTORS;

CLUSTERING ALGORITHM; COMBINATORIAL FORMULATIONS; GEOMETRIC REPRESENTATIONS; MIN CUT BIPARTITIONING FORMULATION; MOVE BASE ALGORITHM; NEIGHBORHOOD OPERATOR; NETLIST PARTITIONING; RATIO CUT BIPARTITIONING FORMULATION;

VLSI CIRCUITS;

EID: 0029354779     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-9260(95)00008-4     Document Type: Review

References (196)

1. Geometric embeddings for faster and better multi-way netlist partitioning
2. A general framework for vertex orderings, with applications to netlist clustering
3. Multi-way partitioning via spacefilling curves and dynamic programming
4. Spectral partitioning: the more eigenvectors, the better
5. A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
6. Advanced search techniques for circuit partitioning
7. Circuit partitioning using a tabu search approach
8. A combined eigenvector tabu search approach for circuit partition
9. An efficient solution to circuit partitioning using tabu search and genetic algorithms
10. Two-way graph partitioning by principal components
11. New heuristics and lower bounds for graph partitioning
12. Multicommodity flows: a survey of recent research
13. Fuzzy partitioning applied to VLSI-floorplanning and placement
14. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
15. An algorithm for partitioning the nodes of a graph
16. A new heuristic for partitioning the nodes of a graph
17. Heuristics based on spacefilling curves for combinatorial problems in euclidean space
18. Iterated descent: a better algorithm for local search in combinatorial optimization problems
19. An algorithm for improving partitions of pin-limited multi-chip systems
20. Near-optimal placement using a quadratic objective function
21. A new adaptive multi-start technique for combinatorial global optimizations
22. Eigenvalues and graph bisection: an average case analysis
23. Graph bisection algorithms with good average case behavior
24. Proc. ACM/IEEE Design Automation Conf.
25. A fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs
26. A genetic algorithm for a special class of the quadratic assignment problem
27. circuit partitioning using parallel mean field annealing algorithms
28. A Heuristic for quadratic boolean programs with applications to quadratic assignment
29. Efficient implementation of the fuzzy c-means clustering algorithms
30. A global router using an efficient approximate multicommodity multiterminal flow algorithm
31. Spectral k-way ratio-cut partitioning and clustering
32. Spectral based multi-way FPGA partitioning
33. Genetic algorithm for node partitioning problem and applications in VLSI design
34. Efficient partitioning of components
35. A new simultaneous circuit partitioning and chip placement approach based on simulated annealing
36. A graph partitioning problem for multiple-chip design
37. The optimal partitioning of networks
38. Circuit partitioning for huge logic emulation systems
39. An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs
40. On area/depth trade-off in LUT-based FPGA technology mapping
41. Random walks for circuit clustering
42. Net partitions yield better module partitions
43. Multi-way VLSI circuit partitioning based on dual net representation
44. Acyclic multi-way partitioning of boolean networks
45. A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design
46. Improved multiple-way circuit partitioning algorithms
47. Graph partitioning usng annealed neural networks
48. Corolla based circuit partitioning and resynthesis
49. Partitioning sequential circuits for logic optimization
50. Placement and average interconnection lengths of computer logic
51. Logic partitioning
52. Lower bounds for the partitioning of graphs
53. A procedure for layout of standard-cell VLSI circuits
54. New faster Kernighan-Lin type graph-partitioning algorithms
55. Partitioning of opto-electronic multichip modules
56. A class of bounded approximation algorithms for graph partitioning
57. Connectivity of random logic
58. A linear time heuristic for improving network partitions
59. Circuit placement methods using multiple eigenvectors and linear probe techniques
60. Circuit placement and cost bounds by eigenvector decomposition
61. Finding clusters in VLSI circuits
62. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
63. Tabu Search-Part I
64. Heuristic improvement technique for bisection of VLSI networks
65. Network flow algorithms
66. Multi-terminal network flows
67. Simulated annealing without rejected moves
68. An efficient eigenvector approach for finding netlist partitions
69. On implementation choices for iterative improvement partitioning algorithms
70. Quantified suboptimality of VLSI layout heuristics
71. Fast spectral methods for ratio cut partitioning and clustering
72. Improving the quadratic objective function in module placement
73. A new approach to effective circuit clustering
74. New spectral methods for ratio cut partitioning and clustering
75. On the intrinsic rent parameter and spectra-based partitioning methodologies
76. Cooling schedules for optimal annealing
77. An r-dimensional quadratic placement algorithm
78. A wire length estimation technique utilizing neighborhood density equations
79. A study of placement techniques
80. A faster algorithm for finding the minimum cut in a graph
81. Minimum fault coverage in reconfigurable arrays
82. An evaluation of bipartitioning techniques
83. Logic partition orderings for multi-FPGA systems
84. An improved spectral graph partitioning algorithm for mapping parallel computations
85. The dynamic locking heuristic - a new graph partitioning algorithm
86. Multiterminal flows in a hypergraph
87. Multi-way system partitioning into single or multiple type FPGAs
88. When clusters meet partitions: new density-based methods for circuit decomposition
89. Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of the circuit
90. Optimal replication for min-cut partitioning
91. Optimal replication for min-cut partitioning
92. Exploiting communication complexity for multilevel logic synthesis
93. Modeling hypergraphs by graphs with the same mincut properties
94. Finding uni-directional cuts based on physical partitioning and logic restructuring
95. The weighted graph-bi-partitioning problem: a look at GA performance
96. Local optimization and the traveling salesman problem
97. Optimization by simulated annealing: an experimental evaluation, Part I, graph partitioning
98. Hierarchical clustering schemes
99. Fast hypergraph partition
100. A fast heuristic for hypergraph bisection
101. Global min cuts in RNC, and other ramifications of a simple min-cut algorithm
102. Toward a general theory of adaptive walks on rugged landscapes
103. An efficient heuristic procedure for partitioning graphs
104. Yield-based system partitioning strategies for MCM and SEM design
105. Optimization by simulated annealing
106. GORDIAN: VLSI placement by quadratic programming and slicing optimization
107. Benchmarks of layout synthesis-evolution and current status
108. A cell-replicating approach to mincut-based circuit partitioning
109. An improved min-cut algorithm for partitioning VLSI networks
110. Constructing test cases for partitioning heuristics
111. Cost minimization of partitions into multiple devices
112. Multi-way netlist partitioning into heterogeneous FPGAs and minimization of total device cost and interconnect
113. On a pin versus block relationship for partition of logic graphs
114. Module clustering to minimize delay in digital networks
115. Approximation algorithms for VLSI partition problems
116. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
117. Graph partitioning using tabu search
118. A replication cut for two-way partitioning
119. Data flow partitioning for clock period and latency minimization
120. Performance driven partitioning using retiming and replication
121. The maximum concurrent flow problem and sparsest cuts
122. The Laplacian spectrum of graphs
123. On clustering for minimum delay/area
124. Computing edge-connectivity in multigraphs and capacitated graphs
125. Improvements of a mincut partition algorithm
126. An efficient algorithm for VLSI network partitioning problem using a cost function with balancing factor
127. Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem
128. A quadratic metric with a simple solution scheme for initial placement
129. Partitioning sparse matrices with eigenvectors of graphs
130. Optimal clustering for delay minimization
131. The use and interpretation of principal component analysis in applied research
132. A fuzzy C-means clustering placement algorithm
133. A projection technique for partitioning the nodes of a graph
134. Partitioning very large circuits using analytical placement techniques
135. A new k-way partitioning approach for multiple types of FPGAs
136. Architecture driven k-way partitioning for multichip modules
137. A timing-driven N-way chip and multi-chip partitioner
138. Fast effective heuristics for the graph bisectioning problem
139. On the graph bisection problem
140. Multiple-way network partitioning
141. Multiple-way network partitioning with different cost functions
142. Finding k-cuts within twice the optimal
143. Partitioning with cone structures
144. Clustering and linear placement
145. A proper model for the partitioning of electrical circuits
146. An improved objective function for mincut circuit partitioning
147. Quadratic boolean programming for performance-driven system partitioning
148. Performance-driven system partitioning on multi-chip modules
149. Timing-driven system partitioning by constraints decoupling method
150. A simple yet effective technique for partitioning
151. Analytical placement: a linear or a quadratic objective function?
152. An algorithm for quadrisection and its application to standard cell placement
153. Efficient and effective palcements for very large circuits
154. An efficient tabu search algorithm for graph bisectioning
155. A new approach of fractal-dimension based module clustering for VLSI layout
156. An improved algorithm for the generalized min-cut partitioning problem
157. A unified approach to partitioning and placement
158. A Gomory-Hu cut tree representation of a netlist partitioning problem
159. A constrained clustering approach for partitioning netlists
160. Generalization of min-cut partitioning to tree structures and its applications
161. Towards efficient hierarchical designs by ratio cut partitioning
162. An improved two-way partitioning algorithm with stable performance
163. An efficient method of partitioning circuits for multiple-FPGA implementation
164. Efficient network flow based min-cut balanced partitioning
165. Circuit clustering for delay minimization under area and pin constraints
166. A probabilistic multi-commodity flow solution to circuit clustering problems
167. A general purpose, multiple-way partitioning algorithm
168. Optimization by iterative improvement: an experimental evaluation on two-way partitioning