A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
The hierarchical organization of molecular structure computations
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Load balancing for unstructured mesh applications
Progress in computer research
A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Using Eigenvectors to Partition Circuits
INFORMS Journal on Computing
Semidefinite programming for graph partitioning with preferences in data distribution
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
| Hi-index | 0.00 |
Terminal propagation is a method developed in the circuit placement community for adding constraints to graph partitioning problems. This paper adapts and expands this idea, and applies it to the problem of partitioning data structures among the processors of a parallel computer. We show how the constraints in terminal propagation can be used to encourage partitions in which messages are communicated only between architecturally near processors. We then show how these constraints can be handled in two important partitioning algorithms, multilevel-KL and spectral bisection. We compare the quality of partitions generated by these algorithms to each other and to partitions generated by more familiar techniques.