Parallel greedy graph matching using an edge partitioning approach

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2010, Pages 45-54

  Patwary, Md Mostofa Ali ^a   Bisseling, Rob H ^b   Manne, Fredrik ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

bulk synchronous parallel; graph; heuristics; karp sipser; matching; partitioning; sparse matrix

Indexed keywords

BULK-SYNCHRONOUS PARALLEL; GRAPH; HEURISTICS; KARP-SIPSER; MATCHING; PARTITIONING; SPARSE MATRICES;

PATTERN MATCHING;

PARALLEL PROGRAMMING;

EID: 78349274025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1863482.1863493     Document Type: Conference Paper

References (20)

1. J. Aronson, A. Frieze, and B. G. Pittel. Maximum matchings in sparse random graphs: Karp-Sipser revisited. Rand. Struct. Alg., 12(2):111-177, 1998.
2. D. A. Bader and K. Madduri. GTGraph: A synthetic graph generator suite. http://www.cc.gatech.edu/~kamesh/GTgraph, 2006.
3. R. H. Bisseling. Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford University Press, 2004.
4. D. Bozdag, A. Gebremedhin, F. Manne, E. Boman, and U. Catalyurek. A framework for scalable greedy coloring on distributed-memory parallel computers. J. Par. Distr. Comput., 68(4):515-535, 2008.
5. U. V. Catalyurek and C. Aykanat. A fine-grain hypergraph model for 2D decomposition of sparse matrices. In Proc. IPDPS, 2001.
6. P. Chebolu, A. Frieze, and P. Melsted. Finding a maximum matching in a sparse random graph in O(n) expected time. Proc. ICALP, pages 161-172, 2008. LNCS 5125.
7. T. A. Davis. University of Florida sparse matrix collection. NA Digest, 92, 1994.
8. I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, 1986.
9. J. M. D. Hill, B. McColl, D. C. Stefanescu, M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, T. Tsantilas, and R. H. Bisseling. BSPlib: The BSP programming library. Par. Comput., 24(14):1947-1980, 1998.
10. R. M. Karp and M. Sipser. Maximum matching in sparse random graphs. Proc. FOCS, pages 364-375, 1981.
11. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. Par. Distr. Comput., 48:96-129, 1998.
12. J. Koster. Parasol matrices. http://www.parallab.uib.no/projects/, 1999.
13. J. Langguth, F. Manne, and P. Sanders. Heuristic initialization for bipartite matching problems. ACM J. Exp. Alg., 15:1.3:1-1.3:22, 2010.
14. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proc. PODC, pages 6-6. ACM, 2009.
15. F. Manne and R. H. Bisseling. A parallel approximation algorithm for the weighted maximum matching problem. In Proc. PPAM, pages 708-717, 2008. LNCS 4967.
16. R. H. Möhring and M. Müller-Hannemann. Cardinality matching: Heuristic search for augmenting paths. Technical Report 439, Tech. Univ. Berlin, Dept. Math., 1995.
17. F. Pellegrini and J. Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In HPCN'96, pages 493-498, 1996. LNCS 1067.
18. W. J. Suijlen. BSPonMPI: An implementation of the BSPlib standard on top of MPI, Version 0.3, 2010.
19. L. G. Valiant. A bridging model for parallel computation. Comm. ACM, 33(8):103-111, 1990.
20. B. Vastenhouw and R. H. Bisseling. A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Review, 47(1):67-95, 2005.