A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A spectral algorithm for envelope reduction of sparse matrices
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
The symmetric eigenvalue problem
The symmetric eigenvalue problem
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Parallel multilevel k-way partitioning scheme for irregular graphs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Load balancing for unstructured mesh applications
Progress in computer research
Parallel Multilevel Graph Partitioning
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Min-Cut Methods for Mapping Dataflow Graphs
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Sourcebook of parallel computing
Architecture Aware Partitioning Algorithms
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Streaming graph partitioning for large distributed graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Fast iterative graph computation with block updates
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The design of a parallel implementation of multilevel recursive spectral bisection on the Cray T3D is described. The code is intended to be fast enough to enable dynamic repartitioning of adaptive meshes and to partition meshes that are too large for workstations. Two innovations in the implementation are recursive asynchronous task teams and a parallel version of the multilevel accelerator. A performance improvement of a factor of 140 over the best available serial implementation is demonstrated.