A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Parallel multilevel k-way partitioning scheme for irregular graphs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Job scheduling in the presence of multiple resource requirements
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Meshed atlases for real-time procedural solid texturing
ACM Transactions on Graphics (TOG)
Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning (Distinguished Paper)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Parallel Tree Projection Algorithm for Sequence Mining
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Sourcebook of parallel computing
Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources
Proceedings of the 41st annual Design Automation Conference
Parallel tree-projection-based sequence mining algorithms
Parallel Computing
Fully automatic cross-associations
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGGRAPH 2004 Papers
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Two algorithms for fast reclustering of dynamic meshed surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
International Journal of High Performance Computing Applications
International Journal of Parallel Programming
Parameter-Free Spatial Data Mining Using MDL
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Ontology-based knowledge fusion framework using graph partitioning
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
An effective offloading middleware for pervasive services on mobile devices
Pervasive and Mobile Computing
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
A layout-aware physical design method for constructing feasible QCA circuits
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Application-specific networks-on-chip topology customization using network partitioning
IFMT '08 Proceedings of the 1st international forum on Next-generation multicore/manycore technologies
Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors
MCS'03 Proceedings of the 4th international conference on Multiple classifier systems
An adaptive implicit-explicit scheme for the DNS and LES of compressible flows on unstructured grids
Journal of Computational Physics
Runtime Reconfiguration of Multiprocessors Based on Compile-Time Analysis
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Combining multiple clusterings using similarity graph
Pattern Recognition
Social Network Analysis and Mining for Business Applications
ACM Transactions on Intelligent Systems and Technology (TIST)
Two-constraint domain decomposition with Space Filling Curves
Parallel Computing
CLICOM: Cliques for combining multiple clusterings
Expert Systems with Applications: An International Journal
Controlling Unstructured Mesh Partitions for Massively Parallel Simulations
SIAM Journal on Scientific Computing
A domain-specific interpreter for parallelizing a large mixed-language visualisation application
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
RIVA: indexing and visualization of high-dimensional data via dimension reorderings
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
DICLENS: Divisive Clustering Ensemble with Automatic Cluster Number
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Unstructured mesh partition improvement for implicit finite element at extreme scale
The Journal of Supercomputing
StreamX10: a stream programming framework on X10
Proceedings of the 2012 ACM SIGPLAN X10 Workshop
Workflow Scheduling to Minimize Data Movement Using Multi-constraint Graph Partitioning
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Proceedings of the sixth ACM international conference on Web search and data mining
Efficient data partitioning model for heterogeneous graphs in the cloud
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Analysis of partitioning strategies for graph processing in bulk synchronous parallel models
Proceedings of the fifth international workshop on Cloud data management
An efficient and scalable family of algorithms for combining clusterings
Engineering Applications of Artificial Intelligence
Journal of Computational Physics
Hi-index | 0.01 |
Traditional graph partitioning algorithms compute a k-way partitioning of a graph such that the number of edges that are cut by the partitioning is minimized and each partition has an equal number of vertices. The task of minimizing the edge-cut can be considered as the objective and the requirement that the partitions will be of the same size can be considered as the constraint. In this paper we extend the partitioning problem by incorporating an arbitrary number of balancing constraints. In our formulation, a vector of weights is assigned to each vertex, and the goal is to produce a k-way partitioning such that the partitioning satisfies a balancing constraint associated with each weight, while attempting to minimize the edge-cut. Applications of this multi-constraint graph partitioning problem include parallel solution of multi-physics and multi-phase computations, that underlay many existing and emerging large-scale scientific simulations. We present new multi-constraint graph partitioning algorithms that are based on the multilevel graph partitioning paradigm. Our work focuses on developing new types of heuristics for coarsening, initial partitioning, and refinement that are capable of successfully handling multiple constraints. We experimentally evaluate the effectiveness of our multi-constraint partitioners on a variety of synthetically generated problems.