Multithreaded algorithms for maxmum matching in bipartite graphs

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012

Volumn , Issue , 2012, Pages 860-872

  Azad, Ariful ^a   Halappanavar, Mahantesh ^b   Rajamanickam, Sivasankaran ^c   Boman, Erik G ^c   Khan, Arif ^a   Pothen, Alex ^a  

^a PURDUE UNIVERSITY   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

bipartite graphs; maximum cardinality matchings; multithreaded algorithm; parallel algorithm

Indexed keywords

AMD OPTERON; AUGMENTING PATH; BIPARTITE GRAPHS; BREADTH-FIRST-SEARCH; CARDINALITIES; CARDINALITY MATCHING; COMMODITY PROCESSORS; DEPTH FIRST SEARCH; MATCHING ALGORITHM; MATCHING PROBLEMS; MATCHINGS; MULTI CORE; MULTI-THREADED ALGORITHMS; MULTI-THREADED IMPLEMENTATION; MULTITHREADED; MULTITHREADED ENVIRONMENTS; SERIAL ALGORITHMS; SHARED MEMORIES; SHARED MEMORY MULTIPROCESSOR; SYNTHETIC GRAPHS;

DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

PARALLEL PROCESSING SYSTEMS;

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

References (23)

1. M. Brady, K. Jung, H. Nguyen, R. Raghavan, and R. Subramonian, "The assignment problem on parallel architectures," Network Flows and Matching. DIMACS, pp. 469-517, 1993.
2. A. Pothen and C.-J. Fan, "Computing the block triangular form of a sparse matrix," ACM Trans. Math. Softw., vol. 16, pp. 303-324, December 1990.
3. R. Burkard, M. Dell'Amico, and S. Martello, Assignment Problems. Society for Industrial and Applied Mathematics, 2009.
4. 5/2 algorithm for maximum matchings in bipartite graphs," SIAM J. Comput., vol. 2, pp. 225-231, 1973.
5. I. S. Duff, K. Kaya, and B. Uc¢¬ar, "Design, analysis and implementation of maximum transversal algorithms," ACM Transactions on Mathematical Software, vol. 28, no. 2, pp. 13:1- 13:31, 2011.
6. J. Langguth, F. Manne, and P. Sanders, "Heuristic initialization for bipartite matching problems," Journal of Experimental Algorithmics (JEA), vol. 15, pp. 1-3, 2010.
7. M. Karpinski and W. Rytter, Fast Parallel Algorithms for Graph Matching Problems. New York, NY, USA: Oxford University Press, Inc., 1998.
8. J. Langguth, M. M. A. Patwary, and F. Manne, "Parallel algorithms for bipartite matching problems on distributed memory computers," Parallel Computing, vol. 37, no. 12, pp. 820-845, 2011.
9. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, ser. STOC '86. New York, NY, USA: ACM, 1986, pp. 136-146.
10. M. A. Patwary, R. Bisseling, and F. Manne, "Parallel greedy graph matching using an edge partitioning approach," in Proceedings of the Fourth International Workshop on High-level Parallel Programming and Applications. ACM, 2010, pp. 45-54.
11. J. C. Setubal, "Sequential and parallel experimental results with bipartite matching algorithms," University of Campinas, Tech. Rep. IC-96-09, 1996.
12. D. Bertsekas, "Auction Algorithms for Network Flow Problems: A Tutorial Introduction," Computational Optimization and Applications, vol. 1, no. 1, pp. 7-66, 1992.
13. D. P. Bertsekas and D. A. Castañon, "Parallel synchronous and asynchronous implementations of the auction algorithm," Parallel Comput., vol. 17, pp. 707-732, September 1991.
14. L. Buš and P. Tvrdík, "Towards auction algorithms for large dense assignment problems," Comput. Optim. Appl., vol. 43, pp. 411-436, July 2009.
15. M. Sathe and O. Schenk, "Computing auction based weighted matchings in massive graphs," 2011, talk presented at ICIAM 2011.
16. F. Manne and R. H. Bisseling, "A parallel approximation algorithm for the weighted maximum matching problem," in Proceedings of the 7th international conference on Parallel processing and applied mathematics, ser. PPAM'07. Berlin, Heidelberg: Springer-Verlag, 2008, pp. 708-717.
17. M. Halappanavar, "Algorithms for vertex-weighted matching in graphs," Ph.D. dissertation, Old Dominion University, Norfolk, VA, USA, 2009.
18. Ü. V. Çatalyürek, F. Dobrian, A. H. Gebremedhin, M. Halappanavar, and A. Pothen, "Distributed-memory parallel algorithms for matching and coloring," in IPDPS Workshops, 2011, pp. 1971-1980.
19. M. Halappanavar, J. Feo, O. Villa, A. Tumeo, and A. Pothen, "Approximate weighted matching on emerging manycore and multithreaded architectures," International Journal of High Performance Computing Applications (IJHPCA), submitted 2011.
20. "AMD Opteron 6100 Series Processor," available at http://www.amd.com/us/products/embedded/processors/opteron/Pages/ opteron-6100-series.aspx.
21. D. Molka, D. Hackenberg, R. Schone, and M. S. Muller, "Memory performance and cache coherency effects on an Intel Nehalem multiprocessor system," in PACT '09: Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques. Washington, DC, USA: IEEE Computer Society, 2009, pp. 261-270.
22. J. Feo, D. Harper, S. Kahan, and P. Konecny, "Eldorado," in CF '05: Proceedings of the 2nd Conference on Computing Frontiers. New York, NY, USA: ACM, 2005, pp. 28-34.
23. D. Chakrabarti and C. Faloutsos, "Graph mining: Laws, generators, and algorithms," ACM Comput. Surv., vol. 38, no. 1, p. 2, 2006.