{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:07:09Z","timestamp":1725754029322},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/ipdps.2019.00085","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:19:46Z","timestamp":1567473586000},"page":"761-770","source":"Crossref","is-referenced-by-count":15,"title":["Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study"],"prefix":"10.1109","author":[{"given":"Sayan","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Mahantesh","family":"Halappanavar","sequence":"additional","affiliation":[]},{"given":"Ananth","family":"Kalyanaraman","sequence":"additional","affiliation":[]},{"given":"Arif","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","first-page":"109","article-title":"Maximum weighted matching using the partitioned global address space model","author":"thorsen","year":"2009","journal-title":"Proceedings of the 2009 Spring Simulation Multiconference"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1177\/1094342006064482"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00393-9"},{"journal-title":"MPI A Message-Passing Interface Standard Version 3 0","article-title":"Message Passing Interface Forum","year":"2012","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"journal-title":"The Parallel Bgl A Generic Library for Distributed Graph Computations","year":"2005","author":"gregor","key":"ref14"},{"journal-title":"PhD thesis","article-title":"Algorithms for Vertex-weighted Matching in Graphs","year":"2009","author":"halappanavar","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.86"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5160935"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1643"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2780584"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2004.007569"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-8675-3_14"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.360"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68564-7_12"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00107"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"journal-title":"Compressed row storage","year":"0","author":"dongarra","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130404"},{"article-title":"Simple distributed weighted matchings","year":"2004","author":"hoepman","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ClusterW.2012.40"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0713020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref26","first-page":"708","article-title":"A parallel approximation algorithm for the weighted maximum matching problem","author":"manne","year":"2007","journal-title":"International Conference on Parallel Processing and Applied Mathematics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"}],"event":{"name":"2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","start":{"date-parts":[[2019,5,20]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2019,5,24]]}},"container-title":["2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8804711\/8820774\/08820975.pdf?arnumber=8820975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:19:35Z","timestamp":1657855175000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2019.00085","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}