{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:33Z","timestamp":1750221273878,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T00:00:00Z","timestamp":1510444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1524852, CCF-1318103, OAC-1305624, CCF-1513201"],"award-info":[{"award-number":["CCF-1524852, CCF-1318103, OAC-1305624, CCF-1513201"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,12]]},"DOI":"10.1145\/3126908.3126938","type":"proceedings-article","created":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T21:02:30Z","timestamp":1510174950000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Parastack"],"prefix":"10.1145","author":[{"given":"Hongbo","family":"Li","sequence":"first","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zizhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Top500 list. http:\/\/www.top500.org\/lists\/2015\/11\/.  Top500 list. http:\/\/www.top500.org\/lists\/2015\/11\/."},{"key":"e_1_3_2_1_2_1","unstructured":"IO-Watchdog. https:\/\/code.google.com\/p\/io-watchdog\/.  IO-Watchdog. https:\/\/code.google.com\/p\/io-watchdog\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Bug occurs after 12 hours. https:\/\/github.com\/open-mpi\/ompi\/issues\/81\/.  Bug occurs after 12 hours. https:\/\/github.com\/open-mpi\/ompi\/issues\/81\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Bug occurs after 200 iterations. https:\/\/github.com\/open-mpi\/ompi\/issues\/99.  Bug occurs after 200 iterations. https:\/\/github.com\/open-mpi\/ompi\/issues\/99."},{"key":"e_1_3_2_1_5_1","unstructured":"NAS parallel benchmarks. https:\/\/www.nas.nasa.gov\/publications\/npb.html.  NAS parallel benchmarks. https:\/\/www.nas.nasa.gov\/publications\/npb.html."},{"key":"e_1_3_2_1_6_1","unstructured":"Probability theory and mathematical statistics: normal approximation to binomial. https:\/\/onlinecourses.science.psu.edu\/stat414\/node\/179.  Probability theory and mathematical statistics: normal approximation to binomial. https:\/\/onlinecourses.science.psu.edu\/stat414\/node\/179."},{"key":"e_1_3_2_1_7_1","unstructured":"HPL\n  : a portable implementation of the high-performance Linpack benchmark for distributed-memory computers. http:\/\/www.netlib.org\/benchmark\/hpl\/.  HPL: a portable implementation of the high-performance Linpack benchmark for distributed-memory computers. http:\/\/www.netlib.org\/benchmark\/hpl\/."},{"key":"e_1_3_2_1_8_1","unstructured":"Paradyn project: Dyninst. http:\/\/www.paradyn.org\/html\/manuals.html#dyninst  Paradyn project: Dyninst. http:\/\/www.paradyn.org\/html\/manuals.html#dyninst"},{"key":"e_1_3_2_1_9_1","unstructured":"Ohio Supercomputer Center's charging policy. https:\/\/www.osc.edu\/supercomputing\/software\/general#charging  Ohio Supercomputer Center's charging policy. https:\/\/www.osc.edu\/supercomputing\/software\/general#charging"},{"key":"e_1_3_2_1_10_1","unstructured":"San Diego Supercomputer Center's charging policy. http:\/\/www.sdsc.edu\/support\/user_guides\/comet.html#charging  San Diego Supercomputer Center's charging policy. http:\/\/www.sdsc.edu\/support\/user_guides\/comet.html#charging"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654104"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370254"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2010.5544927"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.46"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.40"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.701"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145319.1145342"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362643"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/1206212X.2006.11441784"},{"key":"e_1_3_2_1_21_1","volume-title":"TR SAND2013-4744","author":"M.","year":"2013","unstructured":"M. A Heroux and J. Dongarra. Toward a new metric for ranking high performance computing systems . TR SAND2013-4744 , June 2013 . M. A Heroux and J. Dongarra. Toward a new metric for ranking high performance computing systems. TR SAND2013-4744, June 2013."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503237"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542319"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807644"},{"key":"e_1_3_2_1_25_1","first-page":"493","volume-title":"PARCO","author":"Krammer B.","year":"2003","unstructured":"B. Krammer , K. Bidmon , M. S. M\u00fcller , and M. M. Resch . Marmot: An mpi analysis and checking tool . In PARCO , pages 493 -- 500 , 2003 . B. Krammer, K. Bidmon, M. S. M\u00fcller, and M. M. Resch. Marmot: An mpi analysis and checking tool. In PARCO, pages 493--500, 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063451"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370848"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2314100"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2667219"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188548"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594336"},{"key":"e_1_3_2_1_32_1","volume-title":"LCI HPCC","author":"Ohly P.","year":"2007","unstructured":"P. Ohly and W. Krotz-Vogel . Automated mpi correctness checking: What if there was a magic option ? In LCI HPCC , 2007 . P. Ohly and W. Krotz-Vogel. Automated mpi correctness checking: What if there was a magic option? In LCI HPCC, 2007."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1048935.1050204"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2010.5544304"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731494"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342014522573"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345258"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/370049.370462"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1996130.1996143"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2493123.2462907"}],"event":{"name":"SC '17: The International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"],"location":"Denver Colorado","acronym":"SC '17"},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126908.3126938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126908.3126938","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126908.3126938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:08Z","timestamp":1750212668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126908.3126938"}},"subtitle":["efficient hang detection for MPI programs at large scale"],"short-title":[],"issued":{"date-parts":[[2017,11,12]]},"references-count":40,"alternative-id":["10.1145\/3126908.3126938","10.1145\/3126908"],"URL":"https:\/\/doi.org\/10.1145\/3126908.3126938","relation":{},"subject":[],"published":{"date-parts":[[2017,11,12]]},"assertion":[{"value":"2017-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}