This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Incremental Graph Partitioning
August 1997 (vol. 8 no. 8)
pp. 884-896

Abstract—Partitioning graphs into equally large groups of nodes while minimizing the number of edges between different groups is an extremely important problem in parallel computing. For instance, efficiently parallelizing several scientific and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while communication is minimized. Obtaining exact solutions is computationally intractable, since graph partitioning is an NP-complete.

For a large class of irregular and adaptive data parallel applications (such as adaptive graphs), the computational structure changes from one phase to another in an incremental fashion. In incremental graph-partitioning problems the partitioning of the graph needs to be updated as the graph changes over time; a small number of nodes or edges may be added or deleted at any given instant.

In this paper, we use a linear programming-based method to solve the incremental graph-partitioning problem. All the steps used by our method are inherently parallel and hence our approach can be easily parallelized. By using an initial solution for the graph partitions derived from recursive spectral bisection-based methods, our methods can achieve repartitioning at considerably lower cost than can be obtained by applying recursive spectral bisection. Further, the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.

[1] I. Angus, G. Fox, J. Kim, and D. Walker, Solving Problems on Concurrent Processors, vol. 2. Englewood Cliffs, N.J.: Prentice Hall, 1990.
[2] A. Choudhary, G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, S. Ranka, and J. Saltz, "Software Support for Irregular and Loosely Synchronous Problems," Proc. Conf. High Performance Computing for Flight Vehicles, 1992.
[3] F. Ercal, "Heuristic Approaches to Task Allocation for Parallel Computing," PhD thesis, Ohio State Univ., 1988.
[4] G. Fox, Graphical Approach to Load Balancing and Sparse Matrix Vector Multiplication on the Hypercube, M. Schultz, ed.. Berlin: Springer-Verlag, 1988.
[5] G. Fox and W. Furmanski, "Load Balancing Loosely Synchronous Problems with a Neural Network," Proc. Third Conf. Hypercube Concurrent Computers and Applications, vol. 1, pp. 241-278, 1988.
[6] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[7] B. Hendrickson and R. Leland, "An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations," technical report, Sandia Nat'l Labs., Albuquerque, N.M., 1992.
[8] B. Hendrickson and R. Leland, "An Improved Spectral Load Balancing Method," Proc. Sixth SIAM Conf., pp. 953-961, 1993.
[9] B. Hendrickson and R. Leland, "Multidimensional Spectral Load Balancing," technical report, Sandia Nat'l Labs., Albuquerque, 1993.
[10] H. Maini, K. Mehrotra, C. Mohan, and S. Ranka, "Genetic Algorithms for Graph Partitioning and Incremental Graph Partitioning," Proc. Supercomputing '94, Nov. 1994.
[11] N. Mansour, "Physical Optimization Algorithms for Mapping Data to Distributed-Memory Multiprocessors," PhD thesis, Syracuse Univ., N.Y., 1993.
[12] B. Nour-Omid, A. Raefsky, and G. Lyzenga, "Solving Finite Element Equations on Current Computers," Parallel Computations and Their Impact on Mechanics, pp. 209-227, 1986.
[13] C. Ou, S. Ranka, and G. Fox, "Fast Mapping and Remapping Algorithm for Irregular and Adaptive Problems," Proc. 1993 Int'l Conf. Parallel and Distributed Systems, pp. 279-283,Taipei, Taiwan, Dec. 1993.
[14] A. Pothen, H. Simon, and K. Liou, "Partitioning Sparse Matrices with Eigenvectors of Graphs," SIAM J. Matrix Analysis and Application, vol. 11, pp. 430-352, July 1990.
[15] H. Simon, "Partitioning of Unstructured Mesh Problems for Parallel Processing," Proc. Conf. Parallel Methods on Large Scale Structural Analysis and Physics Applications. Permagon Press, 1991.
[16] R. Williams, DIME: Distributed Irregular Mesh Enviroment. California Inst. of Tech nology, Feb. 1990.
[17] R. Williams, "Performance of Dynamic Load-Balancing Algorithm for Unstructured Mesh Calculations," Concurrency, vol. 3, pp. 457-481, 1991.

Index Terms:
Linear-programming, mapping, parallel, refinement, remapping.
Citation:
Chao-Wei Ou, Sanjay Ranka, "Parallel Incremental Graph Partitioning," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 8, pp. 884-896, Aug. 1997, doi:10.1109/71.605773
Usage of this product signifies your acceptance of the Terms of Use.