{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:29Z","timestamp":1750306049976,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"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":["OCI 07-25070"],"award-info":[{"award-number":["OCI 07-25070"]}],"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,6,14]]},"DOI":"10.1145\/3079079.3079104","type":"proceedings-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T19:31:40Z","timestamp":1496259100000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Automatic topology mapping of diverse large-scale parallel applications"],"prefix":"10.1145","author":[{"given":"Juan J.","family":"Galvez","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Nikhil","family":"Jain","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory"}]},{"given":"Laxmikant V.","family":"Kale","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]}],"member":"320","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188576"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60321-2_10","volume-title":"Proc. Irregular '95: Parallel Algorithms for Irregularly Structured Problems","author":"Walshaw C.","year":"1995","unstructured":"C. Walshaw , M. Cross , M. G. Everett , S. Johnson , and K. Mcmanus . Partitioning & mapping of unstructured meshes to parallel machine topologies . In Proc. Irregular '95: Parallel Algorithms for Irregularly Structured Problems , volume 980 , pages 121 -- 126 . Springer , 1995 . C. Walshaw, M. Cross, M. G. Everett, S. Johnson, and K. Mcmanus. Partitioning & mapping of unstructured meshes to parallel machine topologies. In Proc. Irregular '95: Parallel Algorithms for Irregularly Structured Problems, volume 980, pages 121--126. Springer, 1995."},{"key":"e_1_3_2_1_3_1","volume-title":"Bhatele and Laxmikant V. Kale. Application-specific Topology-aware Mapping for Three Dimensional Topologies. In Proceedings of Workshop on Large-Scale Parallel Processing (IPDPS '08)","author":"Abhinav","year":"2008","unstructured":"Abhinav Bhatele and Laxmikant V. Kale. Application-specific Topology-aware Mapping for Three Dimensional Topologies. In Proceedings of Workshop on Large-Scale Parallel Processing (IPDPS '08) , April 2008 . Abhinav Bhatele and Laxmikant V. Kale. Application-specific Topology-aware Mapping for Three Dimensional Topologies. In Proceedings of Workshop on Large-Scale Parallel Processing (IPDPS '08), April 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389128"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995909"},{"key":"e_1_3_2_1_6_1","first-page":"145","volume-title":"Proceedings of the 20th International Conference on Parallel and Distributed Processing, IPDPS'06","author":"Agarwal Tarun","unstructured":"Tarun Agarwal , Amit Sharma , and Laxmikant V. Kal\u00e9 . Topology-aware Task Mapping for Reducing Communication Contention on Large Parallel Machines . In Proceedings of the 20th International Conference on Parallel and Distributed Processing, IPDPS'06 , pages 145 -- 145 , Washington, DC. IEEE Computer Society. Tarun Agarwal, Amit Sharma, and Laxmikant V. Kal\u00e9. Topology-aware Task Mapping for Reducing Communication Contention on Large Parallel Machines. In Proceedings of the 20th International Conference on Parallel and Distributed Processing, IPDPS'06, pages 145--145, Washington, DC. IEEE Computer Society."},{"key":"e_1_3_2_1_7_1","unstructured":"National Center for Supercomputing Applications. Blue waters project. http:\/\/www.ncsa.illinois.edu\/enabling\/bluewaters.  National Center for Supercomputing Applications. Blue waters project. http:\/\/www.ncsa.illinois.edu\/enabling\/bluewaters."},{"key":"e_1_3_2_1_8_1","unstructured":"MILC Collaboration. MIMD Lattice Computation (MILC) Collaboration Home Page. http:\/\/www.physics.indiana.edu\/~sg\/milc.html.  MILC Collaboration. MIMD Lattice Computation (MILC) Collaboration Home Page. http:\/\/www.physics.indiana.edu\/~sg\/milc.html."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188502"},{"issue":"5","key":"e_1_3_2_1_10_1","first-page":"2000","article-title":"Filamentation and forward brillouin scatter of entire smoothed and aberrated laser beams","volume":"7","author":"Still C. H.","year":"2023","unstructured":"C. H. Still , R. L. Berger , A. B. Langdon , D. E. Hinkel , L. J. Suter , and E. A. Williams . Filamentation and forward brillouin scatter of entire smoothed and aberrated laser beams . Physics of Plasmas , 7 ( 5 ): 2023 , 2000 . C. H. Still, R. L. Berger, A. B. Langdon, D. E. Hinkel, L. J. Suter, and E. A. Williams. Filamentation and forward brillouin scatter of entire smoothed and aberrated laser beams. Physics of Plasmas, 7(5):2023, 2000.","journal-title":"Physics of Plasmas"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389091"},{"key":"e_1_3_2_1_13_1","volume-title":"Fast Approximate Quadratic Programming for Graph Matching. PLoS ONE, 10(4)","author":"Vogelstein J. T.","year":"2015","unstructured":"J. T. Vogelstein , J. M. Conroy , V. Lyzinski , L. J. Podrazik , S. G. Kratzer , E. T. Harley , D. E. Fishkind , R. J. Vogelstein , and C. E. Priebe . Fast Approximate Quadratic Programming for Graph Matching. PLoS ONE, 10(4) , 2015 . J. T. Vogelstein, J. M. Conroy, V. Lyzinski, L. J. Podrazik, S. G. Kratzer, E. T. Harley, D. E. Fishkind, R. J. Vogelstein, and C. E. Priebe. Fast Approximate Quadratic Programming for Graph Matching. PLoS ONE, 10(4), 2015."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of the 8th SIAM conference on Parallel Processing for Scientific Computing","author":"Karypis George","year":"1997","unstructured":"George Karypis and Vipin Kumar . A coarse-grain parallel formulation of multi-level k-way graph partitioning algorithm . In Proc. of the 8th SIAM conference on Parallel Processing for Scientific Computing , 1997 . George Karypis and Vipin Kumar. A coarse-grain parallel formulation of multi-level k-way graph partitioning algorithm. In Proc. of the 8th SIAM conference on Parallel Processing for Scientific Computing, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2004.08.028"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1637"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0029-7"},{"key":"e_1_3_2_1_20_1","first-page":"325","volume-title":"Grasp: An Annotated Bibliography","author":"Festa Paola","year":"2002","unstructured":"Paola Festa and Mauricio G.C. Resende . Grasp: An Annotated Bibliography , pages 325 -- 367 . Springer US , Boston, MA , 2002 . Paola Festa and Mauricio G.C. Resende. Grasp: An Annotated Bibliography, pages 325--367. Springer US, Boston, MA, 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322011"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063419"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2012.07.010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.58"}],"event":{"name":"ICS '17: 2017 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Chicago Illinois","acronym":"ICS '17"},"container-title":["Proceedings of the International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3079079.3079104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3079079.3079104","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3079079.3079104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:25Z","timestamp":1750215805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3079079.3079104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":25,"alternative-id":["10.1145\/3079079.3079104","10.1145\/3079079"],"URL":"https:\/\/doi.org\/10.1145\/3079079.3079104","relation":{},"subject":[],"published":{"date-parts":[[2017,6,14]]},"assertion":[{"value":"2017-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}