Abstract
We develop a parallel algorithm for partitioning the vertices of a graph intop≥2 sets in such a way that few edges connect vertices in different sets. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the Kernighan-Lin algorithm for finding small edge separators on a single processor.(1) We use this parallel partitioning algorithm to find orderings for factoring large sparse symmetric positive definite matrices. These orderings not only reduce fill, but also result in good processor utilization and low communication overhead during the factorization. We provide a complexity analysis of the algorithm, as well as some numerical results from an Intel hypercube and a hypercube simulator.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs,The Bell System Technical Journal,49:291–307 (1970).
Charles E. Leiserson, Area-efficient Graph Layouts (for VLSI),Proceedings of the 21st Annual Symposium on Foundations of Computer Science, pp. 270–281 (1980).
John Russell Gilbert,Graph Separator Theorems and Sparse Gaussian Elimination, Ph.D. Thesis, Stanford University (1980).
Richard J. Lipton, Donald J. Rose, and Robert Endre Tarjan, Generalized Nested Dissection,SIAM Journal on Numerical Analysis,16:346–358 (1979).
Richard J. Lipton and Robert Endre Tarjan, Applications of a Planar Separator Theorem,SIAM Journal on Computing,9:615–627 (1980).
Tse-yun Feng, A Survey of Interconnection Networks,IEEE Computer,12:12–27 (1981).
Alan George, Michael T. Heath, Joseph Liu, and Esmond Ng, Sparse Cholesky Factorization on a Local-memory Multiprocessor,SIAM Journal on Scientific and Statistical Computing,9:327–340 (1988).
Earl Zmijewski,Sparse Cholesky Factorization on a Multiprocessor, Ph.D. Thesis, Cornell University (1987).
Earl Zmijewski and John R. Gilbert, A Parallel Algorithm for Sparse Symbolic Cholesky Factorization on a Multiprocessor,Parallel Computing,7:199–210 (1988).
Earl Zmijewski and John R. Gilbert, A Parallel Algorithm for Large Sparse Symbolic and Numeric Cholesky Factorization on a Multiprocessor, Technical Report 86-733, Cornell University (1986).
Alan George, Joseph W. H. Liu, and Esmond Ng, Communication Results for Parallel Sparse Cholesky Factorization on a Hypercube, submitted toParallel Computing (1987).
Alan George and Joseph W. H. Liu,Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall (1981).
T. H. Dunigan, A Message-passing Multiprocessor Simulator. Technical Report ORNL/ TM-9966, Oak Ridge National Laboratory (1986).
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company (1974).
C. M. Fiduccia and R. M. Mattheyses, A Linear-time Heuristic for Improving Network Partitions,Proceedings of the 19th Design Automation Conference, pp. 175–181 (1982).
R. M. Chamberlain, An Algorithm for LU Factorization with Partial Pivoting on the Hypercube, Technical Report CCS 86/11, Chr. Michelsen Institute (1986).
R. M. Chamberlain and M. J. D. Powell, QR Factorization for Linear Least Squares Problems on the Hypercube, Technical Report CCS 86/10, Chr. Michelsen Institute (1986).
Joseph W. H. Liu, The Solution of Mesh Equations on a Parallel Computer, Technical Report, University of Waterloo (1974).
Donald J. Rose, Robert Endre Tarjan, and George S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs,SIAM Journal on Computing,5:266–283 (1976).
Joseph W. H. Liu, Computational Models and Task Scheduling for Parallel Sparse Cholesky Factorization,Parallel Computing,3:327–342 (1986).
Frans J. Peters, Parallel Pivoting Algorithms for Sparse Symmetric Matrices,Parallel Computing,1:99–110 (1984).
John R. Gilbert and Robert Endre Tarjan, The Analysis of a Nested Dissection Algorithm,Numerische Mathematik,50:377–404 (1987).
G. C. Everstine, A Comparison of Three Resequencing Algorithms for the Reduction of Matrix Profile and Wave Front,International Journal for Numerical Methods in Engineering,14:837–853 (1979).
Alan George and Joseph W. H. Liu, An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems,SIAM Journal on Numerical Analysis,15:1053–1069 (1978).
Frans J. Peters, MIMD Machines and Sparse Linear EquationsHighly Parallel Computers: Proceedings of the IFIP WG 10.3 Working Conference on Highly Parallel Computers for Numerical and Signal Processing Applications, 1986, eds., Gerard L. Reijns and Michael H. Barton, pp. 201–210. North-Holland, (1987).
Joseph W. H. Liu, Equivalent Sparse Matrix Reordering by Elimination Tree Rotations,SIAM Journal on Scientific and Statistical Computing,9:424–444, (1988).
Geoffrey C. Fox and Steve W. Otto, Concurrent Computation and the Theory of Complex Systems, Technical Report CALT-68-1343, California Institute of Technology (1986).
I. S. Duff, N. I. M. Gould, M. Lescrenier, and J. K. Reid, The Multifrontal Method in a Parallel Environment, Technical Report CSS 211, Computer Science and Systems Division, AERE Harwell (1987).
Author information
Authors and Affiliations
Additional information
Publication of this report was partially supported by the National Science Foundation under Grant DCR-8451385 and by AT&T Bell Laboratories through their Ph.D scholarship program.
Rights and permissions
About this article
Cite this article
Gilbert, J.R., Zmijewski, E. A parallel graph partitioning algorithm for a message-passing multiprocessor. Int J Parallel Prog 16, 427–449 (1987). https://doi.org/10.1007/BF01388998
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388998