A new diffusion-based multilevel algorithm for computing graph partitions

Journal of Parallel and Distributed Computing

Volumn 69, Issue 9, 2009, Pages 750-761

  Meyerhenke, Henning ^a   Monien, Burkhard ^b   Sauerwald, Thomas ^c  

^a NEC LABORATORIES EUROPE   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Disturbed diffusion; Graph partitioning; Load balancing heuristic

Indexed keywords

ALGEBRAIC MULTIGRID; CONSTRUCTION METHOD; DEGREE OF PARALLELISM; DIFFUSIVE MECHANISMS; DIFFUSIVE PROCESS; DISTURBED DIFFUSION; EDGE CUTS; FEM SIMULATIONS; GRAPH PARTITION; GRAPH PARTITIONING; GRAPH'S VERTICES; HIGH QUALITY; LOAD BALANCER; LOAD BALANCING HEURISTIC; LOAD-BALANCING; LOCAL OPTIMA; MULTILEVEL ALGORITHM; NUMERICAL APPLICATIONS; OBJECTIVE FUNCTIONS; PARALLEL AND DISTRIBUTED PROCESSING; POTENTIAL FUNCTION; PRACTICAL USE; SOLUTION QUALITY; USER REQUIREMENTS;

BALANCING; COMPUTATION THEORY; DIFFUSION; HEURISTIC METHODS; LIBRARIES; OPTIMIZATION; PARALLEL ALGORITHMS;

GRAPH THEORY;

EID: 67650997058     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.04.005     Document Type: Article

References (46)

1. Arora S., and Kale S. A combinatorial, primal-dual approach to semidefinite programs. Proceedings of the 39th Annual ACM Symposium on Theory of Computing. STOC'07 (2007), ACM 227-236
2. Bichot C.-E. A new method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms. Journal of Mathematical Modelling and Algorithms 6 3 (2007) 319-344
3. T. Bui, C. Jones, A heuristic for reducing fill in sparse matrix factorization, in: 6th SIAM Conference on Parallel Processing for Scientific Computing, PPSC, 1993, pp. 445-452
4. Catalyurek U., and Aykanat C. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems 10 7 (1999) 673-693
5. Catalyurek U., Boman E., Devine K., Bozdag D., Heaphy R., and Riesen L. Hypergraph-based dynamic load balancing for adaptive scientific computations. Proceedings of the 21st International Parallel and Distributed Processing Symposium. IPDPS'07 (2007), IEEE Computer Society Best Algorithms Paper Award
6. Chevalier C., and Pellegrini F. Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework. Proceedings of the 12th International Euro-Par Conference. Lecture Notes in Computer Science vol. 4128 (2006), Springer-Verlag 243-252
7. Cybenko G. Dynamic load balancing for distributed memory multiprocessors. Parallel and Distributed Computing 7 (1989) 279-301
8. Dellnitz M., Hessel-von Molo M., Metzner P., Preis R., and Schütte C. Graph algorithms for dynamical systems. Modeling and Simulation of Multiscale Problems (2006), Springer-Verlag 619-646
9. Diekmann R., Preis R., Schlimbach F., and Walshaw C. Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. Parallel Computing 26 (2000) 1555-1581
10. Elsässer R., Monien B., and Preis R. Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems 35 (2002) 305-320
11. Fiduccia C.M., and Mattheyses R.M. A linear-time heuristic for improving network partitions. Proceedings of the 19th Conference on Design automation. DAC'82 (1982), IEEE Press 175-181
12. Harel D., and Koren Y. On clustering using random walks. Proceedings of 21st Foundations of Software Technology and Theoretical Computer Science. FSTTCS'01. Lecture Notes in Computer Science vol. 2245 (2001), Springer-Verlag 18-41
13. Hendrickson B. Graph partitioning and parallel solvers: Has the emperor no clothes?. Proceedings of Irregular'98. Lecture Notes in Computer Science vol. 1457 (1998), Springer-Verlag 218-225
14. Hendrickson B., and Leland R. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing 16 2 (1995) 452-469
15. Hendrickson B., and Leland R. A multi-level algorithm for partitioning graphs. Proceedings Supercomputing'95 (1995), ACM Press 28 (CD)
16. Huang S., Aubanel E., and Bhavsar V.C. PaGrid: A mesh partitioner for computational grids. Journal of Grid Computing 4 1 (2006) 71-88
17. Karypis G., and Kumar V. MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 4.0 (1998)
18. Karypis G., and Kumar V. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48 1 (1998) 96-129
19. Kernighan B.W., and Lin S. An efficient heuristic for partitioning graphs. Bell Systems Technical Journal 49 (1970) 291-308
20. Khandekar R., Rao S., and Vazirani U. Graph partitioning using single commodity flows. Proceedings of the 38th Annual ACM Symposium on Theory of Computing. STOC'06 (2006), ACM 385-390
21. Lloyd S.P. Least squares quantization in PCM. IEEE Transactions on Information Theory 28 2 (1982) 129-136
22. H. Meyerhenke, Disturbed diffusive processes for solving partitioning problems on graphs, Ph.D. Thesis, Universität Paderborn, 2008
23. Meyerhenke H., Monien B., and Schamberger S. Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium. IPDPS'06 (2006), IEEE Computer Society 57 (CD)
24. Meyerhenke H., and Sauerwald T. Analyzing disturbed diffusion on networks. Proceedings of the 17th International Symposium on Algorithms and Computation. ISAAC'06. Lecture Notes in Computer Science vol. 4288 (2006), Springer-Verlag 429-438
25. Meyerhenke H., and Schamberger S. Balancing parallel adaptive FEM computations by solving systems of linear equations. Proceedings of the 11th International Euro-Par Conference. Lecture Notes in Computer Science vol. 3648 (2005), Springer-Verlag 209-219
26. Meyerhenke H., and Schamberger S. A parallel shape optimizing load balancer. Proceedings of the 12th International Euro-Par Conference. Lecture Notes in Computer Science vol. 4128 (2006), Springer-Verlag 232-242
27. Pellegrini F. A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. Proceedings of the 13th International Euro-Par Conference. Lecture Notes in Computer Science vol. 4641 (2007), Springer-Verlag 195-204
28. Preis R. Linear time 1 / 2-approximation algorithm for maximum weighted matching in general graphs. Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. STACS'99. Lecture Notes in Computer Science vol. 1563 (1999), Springer-Verlag 259-269
29. Safro I., Ron D., and Brandt A. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms 60 1 (2006) 24-41
30. Schamberger S. On partitioning FEM graphs using diffusion. Proceedings of the HPGC Workshop of the 18th International Parallel and Distributed Processing Symposium. IPDPS'04 (2004), IEEE Computer Society
31. Schamberger S. A shape optimizing load distribution heuristic for parallel adaptive FEM computations. 8th International Conference on Parallel Computing Technologies. PaCT'05. Lecture Notes in Computer Science vol. 2763 (2005), Springer-Verlag 263-277
32. S. Schamberger, Shape optimized graph partitioning, Ph.D. Thesis, Universität Paderborn, 2006
33. Schloegel K., Karypis G., and Kumar V. Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience 14 3 (2002) 219-240
34. Schloegel K., Karypis G., and Kumar V. Graph partitioning for high performance scientific simulations. The Sourcebook of Parallel Computing (2003), Morgan Kaufmann 491-541
35. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 8 (2000) 888-905
36. Simon H.D., and Teng S.-H. How good is recursive bisection?. SIAM Journal on Scientific Computing 18 5 (1997) 1436-1445
37. Soper A.J., Walshaw C., and Cross M. A combined evolutionary search and multilevel optimisation approach to graph partitioning. Journal of Global Optimization 29 2 (2004) 225-241
38. Spielman D.A., and Teng S.-H. Spectral partitioning works: Planar graphs and finite element meshes. Proceedings of the 37th Symposium on Foundations of Computer Science. FOCS'96 (1996), IEEE Computer Society 96-105
39. Stüben K. An introduction to algebraic multigrid. In: Trottenberg U., Oosterlee C.W., and Schüller A. (Eds). Multigrid (2000), Academic Press 413-532 Appendix A
40. Trifunovic A., and Knottenbelt W. Parallel multilevel algorithms for hypergraph partitioning. Journal of Parallel and Distributed Computing 68 (2008) 563-581
41. Trottenberg U., Oosterlee C.W., and Schüller A. Multigrid (2000), Academic Press
42. C. Walshaw, The graph partitioning archive. http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/, 2009
43. Walshaw C., and Cross M. Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing 22 1 (2000) 63-80
44. Walshaw C., and Cross M. Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Computing 26 12 (2000) 1635-1660
45. Walshaw C., Cross M., and Everett M.G. A localised algorithm for optimising unstructured mesh partitions. International Journal of High Performance Computing Applications 9 4 (1995) 280-295
46. Zumbusch G. Parallel Multilevel Methods: Adaptive Mesh Refinement and Loadbalancing (2003), Teubner