DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Net partitions yield better module partitions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Modeling hypergraphs by graphs with the same mincut properties
Information Processing Letters
Spectral K-way ratio-cut partitioning and clustering
DAC '93 Proceedings of the 30th international Design Automation Conference
Multi-way VLSI circuit partitioning based on dual net representation
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
A hypergraph-partitioning approach for coarse-grain decomposition
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Partitioning for Complex Objectives
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Decomposing Linear Programs for Parallel Solution
PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
An Effective Model to Decompose Linear Programs for Parallel Solution
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Orderings for Parallel Sparse Symmetric Factorization
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
SIAM Journal on Scientific Computing
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
SIAM Journal on Scientific Computing
Journal of Parallel and Distributed Computing
Metrics and models for reordering transformations
MSP '04 Proceedings of the 2004 workshop on Memory system performance
IEEE Transactions on Parallel and Distributed Systems
A hypergraph partitioning based approach for scheduling of tasks with batch-shared I/O
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
IEEE Transactions on Parallel and Distributed Systems
Parallel image restoration using surrogate constraint methods
Journal of Parallel and Distributed Computing
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
Journal of Parallel and Distributed Computing
Parallel Computing - Algorithmic skeletons
Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
SIAM Journal on Scientific Computing
Cache-Oblivious Sparse Matrix-Vector Multiplication by Using Sparse Matrix Partitioning Methods
SIAM Journal on Scientific Computing
Limits of Work-Stealing Scheduling
Job Scheduling Strategies for Parallel Processing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
SIAM Journal on Scientific Computing
Parallel hypergraph partitioning for scientific computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
An Algorithm for Optimal PLA Folding
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient eigenvector approach for finding netlist partitions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs, however, comes at a cost: algorithms on hypergraphs are inherently more complicated than those on graphs, which sometimes translates to nontrivial increases in processing times. Neither the modeling flexibility of hypergraphs nor the runtime efficiency of graph algorithms can be overlooked. Therefore, the new research thrust should be how to cleverly trade off between the two. This work addresses one method for this trade-off by solving the hypergraph partitioning problem by finding vertex separators on graphs. Specifically, we investigate how to solve the hypergraph partitioning problem by seeking a vertex separator on its net intersection graph (NIG), where each net of the hypergraph is represented by a vertex, and two vertices share an edge if their nets have a common vertex. We propose a vertex-weighting scheme to attain good node-balanced hypergraphs, since the NIG model cannot preserve node-balancing information. Vertex-removal and vertex-splitting techniques are described to optimize cut-net and connectivity metrics, respectively, under the recursive bipartitioning paradigm. We also developed implementations of our proposed hypergraph partitioning formulations by adopting and modifying a state-of-the-art graph partitioning by vertex separator tool onmetis. Experiments conducted on a large collection of sparse matrices demonstrate the effectiveness of our proposed techniques.