Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Compressed graphs and the minimum degree algorithm
SIAM Journal on Scientific Computing
How Good is Recursive Bisection?
SIAM Journal on Scientific Computing
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improving the Run Time and Quality of Nested Dissection Ordering
SIAM Journal on Scientific Computing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Improved algorithms for hypergraph bipartitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Multilevel algorithms for multi-constraint graph partitioning
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
A hypergraph-partitioning approach for coarse-grain decomposition
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
Zoltan Data Management Service for Parallel Dynamic Applications
Computing in Science and Engineering
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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 proper model for the partitioning of electrical circuits
DAC '72 Proceedings of the 9th Design Automation Workshop
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Hypergraph Models and Algorithms for Data-Pattern-Based Clustering
Data Mining and Knowledge Discovery
SIAM Journal on Scientific Computing
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
SIAM Journal on Scientific Computing
TopCat: Data Mining for Topic Identification in a Text Corpus
IEEE Transactions on Knowledge and Data Engineering
Journal of Parallel and Distributed Computing
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
Graphs and Hypergraphs
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
Two novel multiway circuit partitioning algorithms using relaxed locking
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A repartitioning hypergraph model for dynamic load balancing
Journal of Parallel and Distributed Computing
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
A Matrix Partitioning Interface to PaToH in MATLAB
Parallel Computing
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
SIAM Journal on Scientific Computing
Integrated data placement and task assignment for scientific workflows in clouds
Proceedings of the fourth international workshop on Data-intensive distributed computing
Replicated partitioning for undirected hypergraphs
Journal of Parallel and Distributed Computing
On partitioning problems with complex objectives
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
Future Generation Computer Systems
SWORD: scalable workload-aware data placement for transactional workloads
Proceedings of the 16th International Conference on Extending Database Technology
A term-based inverted index partitioning model for efficient distributed query processing
ACM Transactions on the Web (TWEB)
| Hi-index | 0.01 |
K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, instead of the widely adopted recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms perform considerably worse when used in the multiple constraint and fixed vertex formulations. We discuss possible reasons for this performance degradation. We describe a careful implementation of a multi-level direct K-way hypergraph partitioning algorithm, which performs better than a well-known recursive-bisection-based partitioning algorithm in hypergraph partitioning with multiple constraints and fixed vertices. We also experimentally show that the proposed algorithm is effective in standard hypergraph partitioning.