Partitioning graphs on message-passing machines by pairwise mincut

Information Sciences

Volumn 111, Issue 1-4, 1998, Pages 223-237

  Sadayappan, P ^a   Ercal, F ^b   Ramanujam, J ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b University of Missouri Rolla   (United States)

^c LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Graph partitioning; Hypercube; Linear speedup; Mapping; Parallel partitioning by pairwise mincut

Indexed keywords

DATA COMMUNICATION SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; PARALLEL ALGORITHMS; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

GRAPH PARTITIONING PROBLEMS; MESSAGE PASSING MACHINES; PARTITIONING BY PAIRWISE MINCUT (PPM);

PARALLEL PROCESSING SYSTEMS;

EID: 0032204329     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(98)10005-1     Document Type: Article

References (15)

1. C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, Proceedings of the 19th Design Automation Conference, 1982, pp. 175-181.
2. G.C. Fox, Load balancing and sparse matrix vector multiplication on the hypercube, Caltech Concurrent Computation Project, Report # 327, 1985.
3. J.R. Gilbert, E. Zmijewski, A parallel graph partitioning algorithm for message passing computers, International Journal of Parallel Programming 16 (1987) 427-449.
4. S. Hammond, Mapping unstructured grid computations to massively parallel computers, Ph.D. thesis, Rensselaer Polytechnic Institute, Department of Computer Science, Troy, NY, 1992.
5. G. Karypis, V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, Proc. Supercomputing 96, Pittsburgh, 1996.
6. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing (to appear).
7. B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Systems Technical Journal 49 (2) (1970) 291-308.
8. R. Moore, A round-robin partitioning algorithm, Technical Report, Computer Science Department, Cornell University, 1988.
9. A. Pothen, H. Simon, K. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis 11 (1990) 43-452.
10. Y. Saad, M. Schultz, Topological properties of hypercubes, IEEE Transactions on Computers C-37 (7) (1988) 867-872.
11. P. Sadayappan, F. Ercal, J. Ramanujam, Cluster-partitioning approaches to mapping parallel programs onto a hypercube, Parallel Computing 13 (1) (1990) 1-16.
12. J. Saltz, H. Berryman, J. Wu, Multiprocessors and runtime compilation, Concurrency: Practice & Experience 3 (6) (1991) 573-592.
13. 3A), ACM Press, 1988, pp. 580-593.
14. H. Simon, Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering 2 (2/3) (1991) 135-148.
15. R. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice & Experience 3 (5) (1991) 457-481.