{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:46:00Z","timestamp":1777675560950,"version":"3.51.4"},"reference-count":19,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"NSF","award":["CCF #1841552\/#1513025"],"award-info":[{"award-number":["CCF #1841552\/#1513025"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2019,11]]},"abstract":"<jats:p>Nondeterminism is an increasingly entrenched property of high-performance computing (HPC) applications and has recently been shown to seriously hamper debugging and reproducibility efforts. Tools for addressing the nondeterministic debugging problem have emerged, but they do not provide methods for systematically cataloging the nondeterminism in a given application. We propose a three-phase workflow for representing executions of nondeterministic message passing interface programs as event graphs, quantifying their structural similarity with graph kernels, and applying machine learning techniques to investigate shared properties across applications. We present an empirical study comparing two graph kernels\u2019 suitability for this task and propose future uses of the methodology.<\/jats:p>","DOI":"10.1177\/1094342019868826","type":"journal-article","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:58:08Z","timestamp":1566349088000},"page":"1175-1184","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["A three-phase workflow for general and expressive representations of nondeterminism in HPC applications"],"prefix":"10.1177","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3774-6853","authenticated-orcid":false,"given":"Dylan","family":"Chapp","sequence":"first","affiliation":[{"name":"The Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA"},{"name":"The Department of Computer and Information Sciences, University of Delaware, Newark, DE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5134-5004","authenticated-orcid":false,"given":"Danny","family":"Rorabaugh","sequence":"additional","affiliation":[{"name":"The Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kento","family":"Sato","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong H","family":"Ahn","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Taufer","sequence":"additional","affiliation":[{"name":"The Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"bibr1-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1145\/2532352.2532357"},{"key":"bibr2-1094342019868826","unstructured":"Chapp D (2017) Study of the Impact of Nondeterminism on Numerical Reproducibility and Debugging at the Exascale. MS Thesis, University of Delaware, Newark, DE."},{"key":"bibr3-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2015.34"},{"issue":"1","key":"bibr4-1094342019868826","first-page":"11","volume":"5","author":"Chapp D","year":"2018","journal-title":"Supercomputing Frontiers and Innovations"},{"key":"bibr5-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2013.05.041"},{"key":"bibr6-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2017.11.002"},{"key":"bibr7-1094342019868826","unstructured":"Kranzlm\u00fcller D (2000) Event Graph Analysis for Debugging Massively Parallel Programs. PhD Thesis, Joh. Kepler University, Linz, Austria."},{"key":"bibr8-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1145\/238020.238054"},{"key":"bibr9-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"bibr10-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69389-5_29"},{"key":"bibr11-1094342019868826","first-page":"65","volume-title":"Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences","author":"Ramon J","year":"2003"},{"key":"bibr12-1094342019868826","volume-title":"Quicksilver (No. Quicksilver; 004652WKSTN00)","author":"Richards D","year":"2016"},{"key":"bibr13-1094342019868826","volume-title":"Structural Simulation Toolkit (SST) (No. SAND2016-3693PE)","author":"Rodrigues AF","year":"2016"},{"key":"bibr14-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807642"},{"key":"bibr15-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018767"},{"key":"bibr16-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2011.62"},{"key":"bibr17-1094342019868826","first-page":"2539","volume":"12","author":"Shervashidze N","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"bibr18-1094342019868826","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.247"},{"key":"bibr19-1094342019868826","first-page":"1201","volume":"11","author":"Vishwanathan SVN","year":"2010","journal-title":"Journal of Machine Learning Research"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342019868826","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342019868826","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342019868826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:15:51Z","timestamp":1777450551000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342019868826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["10.1177\/1094342019868826"],"URL":"https:\/\/doi.org\/10.1177\/1094342019868826","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,20]]}}}