A parallel graph partitioning algorithm for a message-passing multiprocessor
From MaRDI portal
Publication:1111029
DOI10.1007/BF01388998zbMath0657.68073MaRDI QIDQ1111029
John R. Gilbert, Earl Zmijewski
Publication date: 1987
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
hypercube; parallel algorithm; sparse Cholesky factorization; graph partitioning; complexity analysis; Kernighan-Lin algorithm; reordering sparse matrices
65F50: Computational methods for sparse matrices
15A23: Factorization of matrices
68R10: Graph theory (including graph drawing) in computer science
68N25: Theory of operating systems
Related Items
Task scheduling for parallel sparse Cholesky factorization, A parallel graph partitioning algorithm for a message-passing multiprocessor, Partitioning graphs on message-passing machines by pairwise mincut, Approximation techniques for hypergraph partitioning problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel pivoting algorithms for sparse symmetric matrices
- Computational models and task scheduling for parallel sparse Cholesky factorization
- The analysis of a nested dissection algorithm
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Communication results for parallel sparse Cholesky factorization on a hypercube
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
- Generalized Nested Dissection
- Applications of a Planar Separator Theorem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
