{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T06:16:31Z","timestamp":1778134591690,"version":"3.51.4"},"reference-count":17,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1900888 and #1900765"],"award-info":[{"award-number":["#1900888 and #1900765"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>Scientific high performance computing (HPC) applications employ asynchronous executions of MPI calls to improve scalability and performance. The asynchronous calls can lead to non-determinism (ND) in execution, particularly for large exascale simulations. In order to ensure reproducibility and facilitate error detection, it is imperative to identify the sources of non-determinism. Message ND that occurs when the order in which a process sends or receives MPI communication, or executes MPI calls varies across different runs of the same application. We model the MPI calls in the execution as an event graph. The regions of dissimilarity between two event graphs indicate the sources of non-determinism in the MPI calls. Thus by aligning the nodes of the event graphs, we can identify sources of ND. We show that traditional alignment techniques such as NetAlign and learning methodologies such as Graph Autoencoders are not able to align graphs with high accuracy due to the nearly regular degree and large diameter of event graphs. Therefore, we propose a meta graph heuristic that exploits structural properties of event graphs, by combining the set of nodes representing sequences of MPI calls within the same processor as a meta node. We align the meta graphs formed from these meta nodes, and then align the individual nodes within the meta nodes. Our results over three different MPI applications highlight that our meta graph heuristic has better accuracy and scales to large graphs compared to network alignment and graph auto encder methods.<\/jats:p>","DOI":"10.1177\/10943420251398118","type":"journal-article","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T13:37:09Z","timestamp":1769866629000},"page":"367-382","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Application of graph alignment techniques for identifying sources of non-determinism in MPI simulations"],"prefix":"10.1177","volume":"40","author":[{"given":"Dhroov","family":"Pandey","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of North Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2673-3507","authenticated-orcid":false,"given":"Jack","family":"Marquez","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Tennessee"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Taufer","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Tennessee"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8550-5371","authenticated-orcid":false,"given":"Sanjukta","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of North Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"crossref","unstructured":"Bayati M Gerritsen M Gleich DF et al. (2009) Algorithms for large sparse network alignment problems. In: 2009 Ninth IEEE international conference on data mining Miami Florida 06\u201309 December 2009 pp. 705\u2013710.","DOI":"10.1109\/ICDM.2009.135"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpa.2021.100151"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3081530"},{"key":"e_1_3_3_5_1","volume-title":"Monte Carlo Benchmark (MCB)","author":"Gentile N","year":"2010","unstructured":"Gentile N, Miller B (2010) Monte Carlo Benchmark (MCB). Livermore, CA, USA: Lawrence Livermore Nat. Lab. Tech. Rep. TR-LLNL-CODE-507091."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-4-84"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0171428"},{"key":"e_1_3_3_8_1","doi-asserted-by":"crossref","unstructured":"Khan AM Gleich DF Pothen A et al (2012) A multithreaded algorithm for network alignment via approximate matching. In: SC\u201912: Proceedings of the international conference on high performance computing networking storage and analysis. IEEE Salt Lake city UT USA 2012 pp. 1\u201311.","DOI":"10.1109\/SC.2012.8"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1611.07308"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"e_1_3_3_11_1","unstructured":"LLNL (2014) CORAL benchmark suite. Available at: https:\/\/asc.llnl.gov\/coral-benchmarks."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2004.1380112"},{"key":"e_1_3_3_13_1","doi-asserted-by":"crossref","unstructured":"Park M-Y Shim SJ Jun Y-K et al. (2007) Mpirace-check: detection of message races in MPI programs. In: Advances in grid and pervasive computing: Second international conference GPC 2007 Paris France 2\u20134 May 2007. Springer pp. 322\u2013333.","DOI":"10.1007\/978-3-540-72360-8_28"},{"key":"e_1_3_3_14_1","doi-asserted-by":"crossref","unstructured":"Park J Smelyanskiy M Yang UM et al. (2015) High-performance algebraic multigrid solver optimized for multi-core based distributed parallel systems. In: Proceedings of the international conference for high performance computing networking storage and analysis Austin USA 15\u201320 November 2015 pp. 1\u201312.","DOI":"10.1145\/2807591.2807603"},{"key":"e_1_3_3_15_1","article-title":"Pytorch: an imperative style, high-performance deep learning library","author":"Paszke A","year":"2019","unstructured":"Paszke A, Gross S, Massa F, et al. (2019) Pytorch: an imperative style, high-performance deep learning library. Proceedings of the 33rd International Conference on Neural Information Processing Systems.","journal-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems."},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_3_17_1","doi-asserted-by":"crossref","unstructured":"Zhang S Tong H (2016) FINAL: fast attributed network alignment. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD \u201916. New York NY USA 13\u201317 August 2016. Association for Computing Machinery pp. 1345\u20131354.","DOI":"10.1145\/2939672.2939766"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI56570.2024.10635370"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420251398118","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420251398118","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420251398118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T05:46:26Z","timestamp":1778132786000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420251398118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,31]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1177\/10943420251398118"],"URL":"https:\/\/doi.org\/10.1177\/10943420251398118","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,31]]}}}