{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:45:25Z","timestamp":1763459125372,"version":"3.45.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T00:00:00Z","timestamp":1443830400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006168","name":"National Nuclear Security Administration","doi-asserted-by":"publisher","award":["DEAC52-06NA25396"],"award-info":[{"award-number":["DEAC52-06NA25396"]}],"id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0937908, 0958311"],"award-info":[{"award-number":["0937908, 0958311"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Los Alamos National Security"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2014,10,3]]},"abstract":"<jats:p>\n                    Portable parallel benchmarks are widely used for performance evaluation of HPC systems. However, because these are manually produced, they generally represent a greatly simplified view of application behavior, missing the subtle but important-to-performance nuances that may exist in a complete application. This work contributes novel methods to automatically generate highly portable and customizable communication benchmarks from HPC applications. We utilize ScalaTrace, a lossless yet scalable parallel-application tracing framework to collect selected aspects of the run-time\n                    <jats:italic toggle=\"yes\">behavior<\/jats:italic>\n                    of HPC applications, including communication operations and computation time, while abstracting away the\n                    <jats:italic toggle=\"yes\">details<\/jats:italic>\n                    of the computation proper. We subsequently generate benchmarks with nearly identical run-time behavior to the original applications. Results demonstrate that the generated benchmarks are in fact able to preserve the run-time behavior (including both the communication pattern and the execution time) of the original applications. Such automated benchmark generation is without precedent and particularly valuable for proprietary, export-controlled, or classified application codes.\n                  <\/jats:p>","DOI":"10.1145\/2660249","type":"journal-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T08:57:47Z","timestamp":1412672267000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A methodology for automatic generation of executable communication specifications from parallel MPI applications"],"prefix":"10.1145","volume":"1","author":[{"given":"Xing","family":"Wu","sequence":"first","affiliation":[{"name":"North Carolina State University"}]},{"given":"Frank","family":"Mueller","sequence":"additional","affiliation":[{"name":"North Carolina State University"}]},{"given":"Scott","family":"Pakin","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory"}]}],"member":"320","published-online":{"date-parts":[[2014,10,3]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/762761.762787"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_23"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2011.3"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088164"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645456.654829"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391541.2391544"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2007116.2007118"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00024-5"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168882"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v17:10"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582071"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.28"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_71"},{"key":"e_1_2_2_15_1","article-title":"Solution of the first-order form of the 3-D discrete ordinates equation on a massively parallel processor","volume":"65","author":"Koch K. R.","year":"1992","unstructured":"Koch, K. R., Baker, R. S., and Alcouffe, R. E. 1992. Solution of the first-order form of the 3-D discrete ordinates equation on a massively parallel processor. Trans. Amer. Nuclear Soc. 65, 108, 198--199.","journal-title":"Trans. Amer. Nuclear Soc."},{"key":"e_1_2_2_16_1","unstructured":"LLNL. 2002. The ASCI Purple Benchmarks. http:\/\/www.llnl.gov\/asci\/purple\/benchmarks."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1152154.1152162"},{"key":"e_1_2_2_18_1","volume-title":"Proceedings of the International Parallel and Distributed Processing Symposium.","author":"Noeth M.","year":"2007","unstructured":"Noeth, M. Mueller, F., Schulz, M., and de Supinski, B. R. 2007. Scalable compression and replay of communication traces in massively parallel environments. In Proceedings of the International Parallel and Distributed Processing Symposium."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.09.001"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27866-5_9"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1065"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2013.05.351"},{"volume-title":"Proceedings of the 18th Technical Meeting of WoTUG-18: Transputer and Occam Developments. 17--31","author":"Pillet V.","key":"e_1_2_2_23_1","unstructured":"Pillet, V., Labarta, J., Cortes, T., and Girona, S. 1995. PARAVER: A Tool to visualize and analyze parallel code. In Proceedings of the 18th Technical Meeting of WoTUG-18: Transputer and Occam Developments. 17--31."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375537"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413378"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/713705"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899019"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342006064482"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/762761.762785"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/360860.360863"},{"volume-title":"Functional Programming and Its Applications: An Advanced Course","author":"Turner D. A.","key":"e_1_2_2_31_1","unstructured":"Turner, D. A. 1982. Recursion equations as a programming language. In Functional Programming and Its Applications: An Advanced Course, J. Darlington, Peter Henderson, and D. A. Turner Eds., Cambridge University Press, 1--28."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346307"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/379539.379590"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.7"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1177\/109434200001400405"},{"volume-title":"Proceedings of the European Conference on Parallel Computing (Euro-Par). 1301--1304","author":"Wolf F.","key":"e_1_2_2_36_1","unstructured":"Wolf, F. and Mohr, B. 2003. KOJAK---A tool set for automatic performance analysis of parallel applications. In Proceedings of the European Conference on Parallel Computing (Euro-Par). 1301--1304."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.2202"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.114"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941569"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2011.50"},{"key":"e_1_2_2_41_1","unstructured":"Xu Q. Prithivathi R. Subhlok J. and Zheng R. 2008. Logicalization of MPI Communication Traces. Tech. rep. UH-CS-08-07. Dept. of Computer Science University of Houston."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791889.1791901"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654087"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660249","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:39:43Z","timestamp":1763458783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,3]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10,3]]}},"alternative-id":["10.1145\/2660249"],"URL":"https:\/\/doi.org\/10.1145\/2660249","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"type":"print","value":"2329-4949"},{"type":"electronic","value":"2329-4957"}],"subject":[],"published":{"date-parts":[[2014,10,3]]},"assertion":[{"value":"2011-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}