Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry

We study parallel algorithms for computing matchings in graphs and apply them to solve population registration problem from bio-imaging data. We have developed several classes of multithreaded algorithms for maximum cardinality matching and achieved good speedups on three shared memory machines on a...

Full description

Saved in:
Bibliographic Details
Published in:2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops pp. 2494 - 2497
Main Authors: Azad, A., Pothen, A.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2012
Subjects:
Algorithm design and analysis
Approximation algorithms
Approximation methods
Bipartite graph
Flow cytometry
Generalized edge cover
Graph matching
Multicore processing
Program processors
ISBN:1467309745, 9781467309745
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study parallel algorithms for computing matchings in graphs and apply them to solve population registration problem from bio-imaging data. We have developed several classes of multithreaded algorithms for maximum cardinality matching and achieved good speedups on three shared memory machines on a representative set of large real-world and synthetic graphs. The parallel machines include processors that employ multithreading and cache (Intel Nehalem and AMD Opteron) and massively multithreading and flat memory model (Cray XMT). The bio-imaging application involves registering different cell populations across samples using flow cytometry data. The population registration problem is solved by a generalized edge cover, computed from a weighted matching. We have used this approach to differentiate leukemic cells from healthy ones, and to identify phosphorylation shifts in T cells due to stimulation with an antibody. In current work, we are adapting the concept of consistency used in multiple sequence alignments to the population registration problem for large sample sets.
ISBN:1467309745
9781467309745
DOI:10.1109/IPDPSW.2012.310