Multithreaded algorithms for matching in graphs with application to data analysis in flow cytometry

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

Volumn , Issue , 2012, Pages 2494-2497

  Azad, Ariful ^a   Pothen, Alex ^a  

^a Purdue University   (United States)

Author keywords

Flow cytometry; Generalized edge cover; Graph matching

Indexed keywords

AMD OPTERON; BIO-IMAGING; CARDINALITY MATCHING; CELL POPULATIONS; EDGE COVER; GRAPH MATCHINGS; LEUKEMIC CELLS; MATCHINGS IN GRAPHS; MEMORY MODELS; MULTI-THREADED ALGORITHMS; MULTI-THREADING; MULTIPLE SEQUENCE ALIGNMENTS; PARALLEL MACHINE; REGISTRATION PROBLEMS; SAMPLE SETS; SHARED MEMORY MACHINES; SYNTHETIC GRAPHS; T CELLS; WEIGHTED MATCHING;

CELL CULTURE; CELL PROLIFERATION; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; FLOW CYTOMETRY; PHOSPHORYLATION; PROBLEM SOLVING;

POPULATION STATISTICS;

EID: 84867428114     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.310     Document Type: Conference Paper

References (12)

1. J. Langguth, M. Patwary, and F. Manne, "Parallel algorithms for bipartite matching problems on distributed memory computers," Parallel Computing, vol. 37, no. 12, pp. 820-845, 2011.
2. 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 Highlevel Parallel Programming and Applications. ACM, 2010, pp. 45-54.
3. 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.
4. 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.
5. 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.
6. S. Pyne, X. Hu, K. Wang, E. Rossin, T. Lin, L. Maier, C. Baecher-Allan, G. McLachlan, P. Tamayo, D. Hafler et al., "Automated high-dimensional flow cytometric data analysis," Proceedings of the National Academy of Sciences, vol. 106, no. 21, p. 8519, 2009.
7. J. Hopcroft and R. Karp, "A n5/2 algorithm for maximum matchings in bipartite graphs," SIAM J. Comput., vol. 2, pp. 225-231, 1973.
8. I. Duff, K. Kaya, and B. Uçar, "Design, analysis, and implementation of maximum transversal algorithms," ACM Transactions on Mathematical Software (TOMS), vol. 28, no. 2, pp. 13:1-13:31, 2011.
9. A. Azad, M. Halappanavar, S. Rajamanickam, E. Boman, A. Khan, and A. Pothen, "Multithreaded algorithms for maximum matching in bipartite graphs," in IEEE International Parallel & Distributed Processing Symposium (IPDPS). to appear, IEEE, 2012.
10. A. Azad, M. Halappanavar, F. Dobrian, and A. Pothen, "Computing maximum matching in parallel on bipartite graphs: worth the effort?" in Proceedings of the first workshop on Irregular applications: architectures and algorithm. ACM, 2011, pp. 11-14.
11. A. Azad, J. Langguth, Y. Fang, A. Qi, and A. Pothen, "Identifying rare cell populations in comparative flow cytometry," Algorithms in Bioinformatics, pp. 162-175, 2010.
12. A. Azad, S. Pyne, and A. Pothen, "Matching phosphorylation response patterns of antigen-receptor-stimulated t cells via flow cytometry," to appear, BMC Bioinformatics, 2012.