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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops s. 2494 - 2497
Hlavní autoři: Azad, A., Pothen, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2012
Témata:
Algorithm design and analysis
Approximation algorithms
Approximation methods
Bipartite graph
Flow cytometry
Generalized edge cover
Graph matching
Multicore processing
Program processors
ISBN:1467309745, 9781467309745
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
Author Azad, A.
Pothen, A.
Author_xml – sequence: 1
  givenname: A.
  surname: Azad
  fullname: Azad, A.
  email: aazad@purdue.edu
  organization: Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
– sequence: 2
  givenname: A.
  surname: Pothen
  fullname: Pothen, A.
  email: apothen@purdue.edu
  organization: Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
BookMark eNotjE9LwzAYxgMq6ObOHrzkC6y-SdokO5bNzcGGAxWP422brpGuKUlk9Ntb0efy8PzhNyHXnesMIQ8MEsZg8bQ9rA5vnwkHxhPB4IpMWCqVgIVKs1syC-ELRinNOIc7Uu6_22hj4w1WpqJ5e3J-jOdAa-fpHmPZ2O5EbUc3Hvsm0Mu40rzvW1titK6j0dEVRqR5h-0QbPj9rlt3ocshurOJfrgnNzW2wcz-fUo-1s_vy5f57nWzXea7uWUqi3ONmRYGOJayRF3ziqVjwxWwWkABBQojZZGmUKgFyzQyUUENTKeSYy3BiCl5_ONaY8yx9_aMfjjKkaCVEj8EjVWB
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IPDPSW.2012.310
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 2497
ExternalDocumentID 6270877
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-8a583e02ac6ca8f2d14a582701f30b0ba3e66b440b79158a13d0f018462af60e3
IEDL.DBID RIE
ISBN 1467309745
9781467309745
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000309409400324&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 04:57:33 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-8a583e02ac6ca8f2d14a582701f30b0ba3e66b440b79158a13d0f018462af60e3
PageCount 4
ParticipantIDs ieee_primary_6270877
PublicationCentury 2000
PublicationDate 2012-May
PublicationDateYYYYMMDD 2012-05-01
PublicationDate_xml – month: 05
  year: 2012
  text: 2012-May
PublicationDecade 2010
PublicationTitle 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops
PublicationTitleAbbrev ipdpsw
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000781220
Score 1.5118661
Snippet We study parallel algorithms for computing matchings in graphs and apply them to solve population registration problem from bio-imaging data. We have developed...
SourceID ieee
SourceType Publisher
StartPage 2494
SubjectTerms Algorithm design and analysis
Approximation algorithms
Approximation methods
Bipartite graph
Flow cytometry
Generalized edge cover
Graph matching
Multicore processing
Program processors
Title Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry
URI https://ieeexplore.ieee.org/document/6270877
WOSCitedRecordID wos000309409400324&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaioEJUIv4lgdGQm0nsZ2xaikwUEUCRLfKSS5QqU1QmoL67zkn_RASC1tiJZJ1Z9nvzvfeEXJtjApMxLSjcOtzPMM9J1C214tIAN1vJcl01WxCjUZ6PA7CBrnZcmEAoCo-g1v7WN3lJ3m8tKmyrhTK6tc1SVMpWXO1tvkUK1ojBKu4WxKXLeJkfyPptHlfS_twFnQfw0H4_GZLuwSGrexXb5XqaBke_G9Sh6Sz4-jRcHv6HJEGZG0S13xa9I9JIKG92XuOwf_HfEERm9In3HZtwolOM3pvhaoX1KZhaW93iU3LnA5MaehGrMR-O5zl37S_KvM5lMWqQ16Hdy_9B2fdRsGZIjYoHW187QITJpax0alIuIcjOGueuixikXFBysjzWKQC7mvD3YSlDCM_KUwqGbjHpJXlGZwQCoF2I_yfA1oVOBjfxMAAQQogbBTuKWlbA00-a6WMydo2Z38Pn5N9a_-6fPCCtMpiCZdkL_4qp4viqnLvD9DvolI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4gmuhJDRjf7sGjld3ta3skIEIE0kSM3Mi2nSIJtAaKhn_vbMsjJl68tZs22cxsdr-Zne8bQu6Vcj0VMGm4uPUZluKW4bm614uIAN2vJclk3mzC7fflcOj5JfKw5cIAQF58Bo_6Mb_Lj9JwqVNlNUe4Wr9uj-zbliVYwdbaZlS0bI0QLGdvObhwESnbG1Gnzfta3Iczr9bxm_7ruy7uEhi4sl_dVfLDpXX8v2mdkOqOpUf97flzSkqQVEhYMGrRQyqCiNan4xTD_4_ZgiI6pT3ceHXKiU4S-qylqhdUJ2JpfXeNTbOUNlWm6EauRH_bmqbftLHK0hlk81WVvLWeBo22sW6kYEwQHWSGVLY0gQkVOqGSsYi4hSM4ax6bLGCBMsFxAstigetxWypuRixmGPs5QsUOA_OMlJM0gXNCwZNmgP9zQKsCB2WrEBggTAEEjsK8IBVtoNFnoZUxWtvm8u_hO3LYHvS6o26n_3JFjrQvimLCa1LO5ku4IQfhVzZZzG9zV_8AdFmlmQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+26th+IEEE+International+Parallel+and+Distributed+Processing+Symposium+Workshops&rft.atitle=Multithreaded+Algorithms+for+Matching+in+Graphs+with+Application+to+Data+Analysis+in+Flow+Cytometry&rft.au=Azad%2C+A.&rft.au=Pothen%2C+A.&rft.date=2012-05-01&rft.pub=IEEE&rft.isbn=9781467309745&rft.spage=2494&rft.epage=2497&rft_id=info:doi/10.1109%2FIPDPSW.2012.310&rft.externalDocID=6270877
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467309745/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467309745/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467309745/sc.gif&client=summon&freeimage=true