Keywords
NetlistCluster analysisComputer scienceSimulated annealingAlgorithmVery-large-scale integrationTheoretical computer scienceArtificial intelligence
Related Publications
New spectral methods for ratio cut partitioning and clustering
Partitioning of circuit netlists in VLSI design is considered. It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approxi...
An efficient eigenvector approach for finding netlist partitions
A fast eigenvector technique for obtaining good initial node partitions of netlists for use in interchange heuristics is described. The method is based on approximating the netl...
An Efficient Heuristic Procedure for Partitioning Graphs
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This pr...
Information transfer and area-time tradeoffs for VLSI multiplication
The need to transfer information between processing elements can be a major factor in determining the performance of a VLSI circuit. We show that communication considerations al...
Applying the genetic approach to simulated annealing in solving some NP-hard problems
A stochastic approach called the annealing-genetic algorithm is presented for solving some well-known combinatorial optimization problems. This approach incorporates genetic alg...
Publication Info
- Year
- 1995
- Type
- article
- Volume
- 19
- Issue
- 1-2
- Pages
- 1-81
- Citations
- 638
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
638
OpenAlex
Cite This
Charles J. Alpert,
Andrew B. Kahng
(1995).
Recent directions in netlist partitioning: a survey.
Integration
, 19
(1-2)
, 1-81.
https://doi.org/10.1016/0167-9260(95)00008-4
Identifiers
- DOI
- 10.1016/0167-9260(95)00008-4