A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A Cartesian Parallel Nested Dissection Algorithm
SIAM Journal on Matrix Analysis and Applications
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Scalable parallel formulations of the barnes-hut method for n-body simulations
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Geometric mesh partitioning: implementation and experiments
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
ICPADS '09 Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems
SSDE: fast graph drawing using sampled spectral distance embedding
GD'06 Proceedings of the 14th international conference on Graph drawing
Accelerating shape optimizing load balancing for parallel fem simulations by algebraic multigrid
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods
ISPDC '12 Proceedings of the 2012 11th International Symposium on Parallel and Distributed Computing
Exploiting sparsity, structure, and geometry for knowledge discovery
Exploiting sparsity, structure, and geometry for knowledge discovery
| Hi-index | 0.00 |
We consider partitioning a graph in parallel using a large number of processors. Parallel multilevel partitioners, such as Pt-Scotch and ParMetis, produce good quality partitions but their performance scales poorly. Coordinate bisection schemes such as those in Zoltan, which can be applied only to graphs with coordinates, scale well but partition quality is often compromised. We seek to address this gap by developing a scalable parallel scheme which imparts coordinates to a graph through a lattice-based multilevel embedding. Partitions are computed with a parallel formulation of a geometric scheme that has been shown to provide provably good cuts on certain classes of graphs. We analyze the parallel complexity of our scheme and we observe speed-ups and cut-sizes on large graphs. Our results indicate that our method is substantially faster than ParMetis and Pt-Scotch for hundreds to thousands of processors, while producing high quality cuts.