{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:49:15Z","timestamp":1760820555955,"version":"3.38.0"},"reference-count":20,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T00:00:00Z","timestamp":1373500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p> Ever-increasing core counts create the need to develop parallel algorithms that avoid closely coupled execution across all cores. We present performance analysis of several parallel asynchronous implementations of Jacobi\u2019s method for solving systems of linear equations, using MPI, SHMEM and OpenMP. In particular we have solved systems of over 4 billion unknowns using up to 32,768 processes on a Cray XE6 supercomputer. We show that the precise implementation details of asynchronous algorithms can strongly affect the resulting performance and convergence behaviour of our solvers in unexpected ways, discuss how our specific implementations could be generalised to other classes of problem, and suggest how existing parallel programming models might be extended to allow asynchronous algorithms to be expressed more easily. <\/jats:p>","DOI":"10.1177\/1094342013493123","type":"journal-article","created":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T01:27:04Z","timestamp":1373592424000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":20,"title":["Performance analysis of asynchronous Jacobi\u2019s method implemented in MPI, SHMEM and OpenMP"],"prefix":"10.1177","volume":"28","author":[{"given":"Iain","family":"Bethune","sequence":"first","affiliation":[{"name":"EPCC, The University of Edinburgh, UK"}]},{"given":"J Mark","family":"Bull","sequence":"additional","affiliation":[{"name":"EPCC, The University of Edinburgh, UK"}]},{"given":"Nicholas J","family":"Dingle","sequence":"additional","affiliation":[{"name":"School of Mathematics, University of Manchester, UK"}]},{"given":"Nicholas J","family":"Higham","sequence":"additional","affiliation":[{"name":"School of Mathematics, University of Manchester, UK"}]}],"member":"179","published-online":{"date-parts":[[2013,7,11]]},"reference":[{"key":"bibr1-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213124"},{"key":"bibr2-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-006-4667-8"},{"key":"bibr3-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322067"},{"volume-title":"Parallel and Distributed Computation: Numerical Methods","year":"1989","author":"Bertsekas D","key":"bibr4-1094342013493123"},{"key":"bibr5-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55895-0_431"},{"key":"bibr6-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1145\/2020373.2020375"},{"key":"bibr7-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-011-0174-5"},{"key":"bibr8-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(69)90028-7"},{"key":"bibr9-1094342013493123","unstructured":"Cray Inc. (2011) intro_shmem man pages. Available at:  http:\/\/docs.cray.com."},{"key":"bibr10-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.08.022"},{"key":"bibr11-1094342013493123","first-page":"1071","volume":"268","author":"Fagan MJ","year":"2007","journal-title":"Journal of Morphology"},{"key":"bibr12-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00409-X"},{"key":"bibr13-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75416-9_22"},{"volume-title":"Communication-avoiding Krylov subspace methods","year":"2010","author":"Hoemmen M","key":"bibr14-1094342013493123"},{"volume-title":"Proceedings of the Cray User Group (CUG) 2012","year":"2012","author":"Maynard C","key":"bibr15-1094342013493123"},{"key":"bibr16-1094342013493123","unstructured":"MPI Forum (2009) MPI: A message-passing interface standard. Version 2.2.  Available at: http:\/\/www.mpi-forum.org."},{"key":"bibr17-1094342013493123","unstructured":"OpenMP Architecture Review Board (2011) OpenMP application program interface. Available at: http:\/\/www.openmp.org\n."},{"key":"bibr18-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"bibr19-1094342013493123","unstructured":"SHM (2012) OpenSHMEM application programming interface. Version 1.0  Available at: http:\/\/www.openshmem.org\/."},{"key":"bibr20-1094342013493123","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2006.63"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342013493123","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342013493123","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342013493123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T13:16:34Z","timestamp":1740921394000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342013493123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,11]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["10.1177\/1094342013493123"],"URL":"https:\/\/doi.org\/10.1177\/1094342013493123","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2013,7,11]]}}}