Results 1  10
of
40
Multilevel hypergraph partitioning: Application in VLSI domain
 IEEE TRANS. VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS
, 1999
"... In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the origina ..."
Abstract

Cited by 241 (21 self)
 Add to MetaCart
In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the original hypergraph by successively projecting and refining the bisection to the next level finer hypergraph. We have developed new hypergraph coarsening strategies within the multilevel framework. We evaluate their performance both in terms of the size of the hyperedge cut on the bisection, as well as on the run time for a number of very large scale integration circuits. Our experiments show that our multilevel hypergraphpartitioning algorithm produces highquality partitioning in a relatively small amount of time. The quality of the partitionings produced by our scheme are on the average 6%–23 % better than those produced by other stateoftheart schemes. Furthermore, our partitioning algorithm is significantly faster, often requiring 4–10 times less time than that required by the other schemes. Our multilevel hypergraphpartitioning algorithm scales very well for large hypergraphs. Hypergraphs with over 100 000 vertices can be bisected in a few minutes on today’s workstations. Also, on the large hypergraphs, our scheme outperforms other schemes (in hyperedge cut) quite consistently with larger margins (9%–30%).
Multilevel kway Hypergraph Partitioning
, 1999
"... In this paper, we present a new multilevel kway hypergraph partitioning algorithm that substantially outperforms the existing stateoftheart KPM/LR algorithm for multiway partitioning, both for optimizing local as well as global objectives. Experiments on ..."
Abstract

Cited by 129 (7 self)
 Add to MetaCart
In this paper, we present a new multilevel kway hypergraph partitioning algorithm that substantially outperforms the existing stateoftheart KPM/LR algorithm for multiway partitioning, both for optimizing local as well as global objectives. Experiments on
VLSI cell placement techniques
 ACM Computing Surveys
, 1991
"... VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasi ..."
Abstract

Cited by 75 (0 self)
 Add to MetaCart
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard ce11and macro
HypergraphPartitioning Based Decomposition for Parallel SparseMatrix Vector Multiplication
 IEEE Trans. on Parallel and Distributed Computing
"... In this work, we show that the standard graphpartitioning based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrixvector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph mo ..."
Abstract

Cited by 61 (34 self)
 Add to MetaCart
In this work, we show that the standard graphpartitioning based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrixvector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph model. The proposed models reduce the decomposition problem to the wellknown hypergraph partitioning problem. The recently proposed successful multilevel framework is exploited to develop a multilevel hypergraph partitioning tool PaToH for the experimental verification of our proposed hypergraph models. Experimental results on a wide range of realistic sparse test matrices confirm the validity of the proposed hypergraph models. In the decomposition of the test matrices, the hypergraph models using PaToH and hMeTiS result in up to 63% less communication volume (30%38% less on the average) than the graph model using MeTiS, while PaToH is only 1.32.3 times slower than MeTiS on the average. ...
VLSI Circuit Partitioning by ClusterRemoval using Iterative Improvement Techniques
 Proc. IEEE International Conference on ComputerAided Design
, 1996
"... Movebased iterative improvement partitioning methods such as the FiducciaMattheyses (FM) algorithm [3] and Krishnamurthy's LookAhead (LA) algorithm [4] are widely used in VLSI CAD applications largely due to their time efficiency and ease of implementation. This class of algorithms is of the "loc ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
Movebased iterative improvement partitioning methods such as the FiducciaMattheyses (FM) algorithm [3] and Krishnamurthy's LookAhead (LA) algorithm [4] are widely used in VLSI CAD applications largely due to their time efficiency and ease of implementation. This class of algorithms is of the "local improvement" type. They generate relatively high quality results for small and medium size circuits. However, as VLSI circuits become larger, these algorithms are not so effective on them as direct partitioning tools. We propose new iterativeimprovement methods that select cells to move with a view to moving clusters that straddle the two subsets of a partition into one of the subsets. The new algorithms significantly improve partition quality while preserving the advantage of time efficiency. Experimental results on 25 medium to large size ACM/SIGDA benchmark circuits show up to 70% improvement over FM in cutsize, with an average of percircuit percent improvements of about 25%, and a t...
ProbabilityBased Approaches to VLSI Circuit Partitioning
, 2000
"... Iterativeimprovement 2way mincut partitioning is an important phase in most circuit placement tools, and finds use in many other CAD applications. Most iterative improvement techniques for circuit netlists like the FiducciaMattheyses (FM) method compute the gains of nodes using local netlist info ..."
Abstract

Cited by 42 (7 self)
 Add to MetaCart
Iterativeimprovement 2way mincut partitioning is an important phase in most circuit placement tools, and finds use in many other CAD applications. Most iterative improvement techniques for circuit netlists like the FiducciaMattheyses (FM) method compute the gains of nodes using local netlist information that is only concerned with the immediate improvement in the cutset. This can lead to misleading gain information. Krishnamurthy suggested a lookahead (LA) gain calculation method to ameliorate this situation; however, as we show, it leaves room for improvement. We present here a probabilistic gain computation approach called PROP (PRObabilistic Partitioner) that is capable of capturing the future implications of moving a node at the current time. We also propose an extended algorithm SHRINKPROP that increases the probability of removing recently "perturbed" nets (nets whose nodes have been moved for the first time) from the cutset. This is necessary, since in a regular move process, the removal probabilities of most nets either remain unchanged or even decrease when their nodes are moved for the first time. Experimental results on medium to largesize ACM/SIGDA benchmark circuits show that PROP and SHRINKPROP outperform previous iterativeimprovement methods like FM (by about 30% and 37%, respectively) and LA (by about 27% and 34%, respectively). Both PROP and SHRINKPROP also obtain much better cutsizes than many recent stateoftheart partitioners like EIG1, WINDOW, MELO, PARABOLI, GFM and GMetis (by 4.5% to 67%). We also show that the space and time complexities of PROP and SHRINKPROP are very reasonable. Our empirical timing results reveal that PROP is appreciably faster than all recent techniques except GMetisall other partitioners including ours work on...
On the Intrinsic Rent Parameter and SpectraBased Partitioning Methodologies
 IEEE Trans. on Comput.Aided Des., Integrated Circuits & Syst
, 1994
"... The complexity of circuit designs has necessitated a topdown approach to layout synthesis. A large body of work shows that a good layout hierarchy, or partitioning tree, as measured by the associated Rent parameter, will correspond to an areaefficient layout. We define the intrinsic Rent parameter ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
The complexity of circuit designs has necessitated a topdown approach to layout synthesis. A large body of work shows that a good layout hierarchy, or partitioning tree, as measured by the associated Rent parameter, will correspond to an areaefficient layout. We define the intrinsic Rent parameter of a netlist to be the minimum possible Rent parameter of any partitioning tree for the netlist. Experimental results show that spectrabased ratio cut partitioning algorithms yield partitioning trees with the lowest observed Rent parameter over all benchmarks and over all algorithms tested. For examples where the intrinsic Rent parameter is known, spectral ratio cut partitioning yields a partitioning tree with Rent parameter essentially identical to this theoretical optimum. These results have deep implications withrespect to both the choice of partitioning algorithms for topdown layout, as well as new approaches to layout area estimation. The paper concludes with directions for future research, including several promising techniques for fast estimation of the (intrinsic) Rent parameter.
Geometric Embeddings for Faster and Better MultiWay Netlist Partitioning
 Proc. ACM/IEEE Design Automation Conf
, 1993
"... We give new, effective algorithms for kway circuit partitioning in the two regimes of k ø n and k = \Theta(n), where n is the number of modules in the circuit. We show that partitioning an appropriately designed geometric embedding of the netlist, rather than a traditional graph representation, yi ..."
Abstract

Cited by 30 (15 self)
 Add to MetaCart
We give new, effective algorithms for kway circuit partitioning in the two regimes of k ø n and k = \Theta(n), where n is the number of modules in the circuit. We show that partitioning an appropriately designed geometric embedding of the netlist, rather than a traditional graph representation, yields improved results as well as large speedups. We derive d dimensional geometric embeddings of the netlist via (i) a new "partitioningspecific" net model for constructing the Laplacian of the netlist, and (ii) computation of d eigenvectors of the netlist Laplacian; we then apply (iii) fast topdown and bottomup geometric clustering methods. 1 Preliminaries In topdown layout synthesis of complex VLSI systems, the goal of partitioning/clustering is to reveal the natural circuit structure, via a decomposition into k subcircuits which minimizes connectivity between subcircuits. A generic problem statement is as follows: kWay Partitioning: Given a circuit netlist G = (V; E) with jV j...
Decomposing irregularly sparse matrices for parallel matrixvector multiplications
 LECTURE NOTES IN COMPUTER SCIENCE
, 1996
"... In this work, we show the de ciencies of the graph model for decomposing sparse matrices for parallel matrixvector multiplication. Then, we propose two hypergraph models which avoid all de ciencies of the graph model. The proposed models reduce the decomposition problem to the wellknown hypergrap ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
In this work, we show the de ciencies of the graph model for decomposing sparse matrices for parallel matrixvector multiplication. Then, we propose two hypergraph models which avoid all de ciencies of the graph model. The proposed models reduce the decomposition problem to the wellknown hypergraph partitioning problem widely encountered in circuit partitioning in VLSI. We have implemented fast KernighanLin based graph and hypergraph partitioning heuristics and used the successful multilevel graph partitioning tool (Metis) for the experimental evaluation of the validity of the proposed hypergraph models. We have also developed a multilevel hypergraph partitioning heuristic for experimenting the performance of the multilevel approach on hypergraph partitioning. Experimental results on sparse matrices, selected from HarwellBoeing collection and NETLIB suite, con rm both the validity of our proposed hypergraph models and appropriateness of the multilevel approach to hypergraph partitioning.