Engineering a scalable high quality graph partitioner

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010

Volumn , Issue , 2010, Pages

  Holtgrewe, Manuel ^a   Sanders, Peter ^a   Schulz, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH PARTITIONING; HIGH QUALITY; LOCAL SEARCH ALGORITHM; LOCAL SEARCH HEURISTICS; MATCHINGS; MULTI-LEVEL; PARALLELIZATIONS; PRIORITIZATION; QUALITY IMPROVEMENT; SOLUTION QUALITY;

DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; PARALLEL ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 77953970034     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2010.5470485     Document Type: Conference Paper

References (28)

1. Amine Abou-Rjeili and George Karypis. Multilevel algorithms for partitioning power-law graphs. In International Parallel & Distributed Processing Symposium, 2006.
2. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
3. M. J. Berger and S. H. Bokhari. A partitioning strategy for pdes across multiprocessors. In ICPP, pages 166-170, 1985.
4. T. Davis. The University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices, 2008.
5. D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks, volume 5515 of LNCS State-of-the-Art Survey, pages 117-139. Springer, 2009.
6. D. Drake and S. Hougardy. Improved linear time approximation algorithms for weighted matchings. In 7th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX), LNCS 2764, pages 14-23, 2003.
7. D. Drake and S. Hougardy. A simple approximation algorithm for the weighted matching problem. Information Processing Letters, 85:211-213, 2003.
8. R. Preis et al. PARTY partitioning library. http://wwwcs.uni-paderborn. de/fachbereich/AG/monien/RESEARCH/PART/party.html.
9. R. P. Fedorenko. A relaxation method for solving elliptic difference equations. USSR Comput. Math. and Math. Phys, 5(1):1092-1096, 1961.
10. C. M. Fiduccia and R. M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions. In 19th Conference on Design Automation, pages 175-181, 1982.
11. P.O. Fjallstrom. Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science, 3(10), 1998.
12. R. Geisberger, P. Sanders, and D. Schultes. Better approximation of betweenness centrality. In 10th Workshop on Algorithm Engineering and Experimentation, pages 90-108, San Francisco, 2008. SIAM.
13. B. Hendrickson. Chaco: Software for partitioning graphs. http://www.sandia.gov/~bahendr/chaco.html.
14. B. Hendrickson. Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract). In IRREGULAR, pages 218-225, 1998.
15. M. Holtgrewe. A scalable coarsening phase for a multi-level partitioning algorithm. Diploma thesis, Universität Karlsruhe, 2009.
16. F. Manne and R. H. Bisseling. A parallel approximation algorithm for the weighted maximum matching problem. In 7th Int. Conf. on Parallel Processing and Applied Mathematics (PPAM), volume 4967 of LNCS, pages 708-717. Springer, 2007.
17. J. Maue and P. Sanders. Engineering algorithms for approximate weighted matching. In 6th Workshop on Exp. Algorithms (WEA), volume 4525 of LNCS, pages 242-255. Springer, 2007.
18. H. Meyerhenke, B. Monien, and T. Sauerwald. A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. In IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., pages 1-13, 2008.
19. F. Pellegrini. Scotch home page. http://www.labri.fr/pelegrin/scotch.
20. S. Pettie and P. Sanders. A simpler linear time 2/3 - ε approximation for maximum weight matching. Information Processing Letters, 91(6):271-276, 2004.
21. R. Preis. Linear time 1 /2-approximation algorithm for maximum weighted matching in general graphs. In 16th Symp. on Theoretical Aspects ofComputer Science, volume 1563 of LNCS, pages 259-269. Springer, 1999.
22. K. Schloegel, G. Karypis, and V. Kumar. Graph partitioning for high performance scientific simulations. In J. Dongarra et al., editor, CRPC Par. Comp. Handbook. Morgan Kaufmann, 2000.
23. C. Schulz. Scalable parallel refinement of graph partitions. Diploma thesis, Universitat Karlsruhe, 2009.
24. A. J. Soperm, C. Walshaw, and M. Cross. A combined evolutionary search and multilevel optimisation approach to graph partitioning. J. Global Optimization, 29(2):225-241, 2004.
25. R. V. Southwell. Stress-calculation in frameworks by the method of "Systematic relaxation of constraints". Proc. Roy. Soc. Edinburgh Sect. A, pages 57-91, 1935.
26. C. Walshaw. The Graph Partitioning Archive, http://staffweb.cms.gre.ac. uk/~c.walshaw/partition/, 2008.
27. C. Walshaw and M. Cross. Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm. SIAM Journal on Scientific Computing, 22(1):63-80, 2000.
28. C. Walshaw and M. Cross. JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. In F. Magoules, editor, Mesh Partitioning Techniques and Domain Decomposition Techniques, pages 27-58. Civil-Comp Ltd., 2007. (Invited chapter).