{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:06:06Z","timestamp":1769850366214,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T00:00:00Z","timestamp":1370822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,10]]},"DOI":"10.1145\/2464996.2467268","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["A stencil compiler for short-vector SIMD architectures"],"prefix":"10.1145","author":[{"given":"Tom","family":"Henretty","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}]},{"given":"Richard","family":"Veras","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Franz","family":"Franchetti","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, OH, USA"}]},{"given":"J.","family":"Ramanujam","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice-Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993."},{"key":"e_1_3_2_1_2_1","volume-title":"SC","author":"Bandishti V.","year":"2012","unstructured":"V. Bandishti , I. Pananilath , , and U. Bondhugula . Tiling stencil computations to maximize parallelism . In SC , 2012 . V. Bandishti, I. Pananilath, , and U. Bondhugula. Tiling stencil computations to maximize parallelism. In SC, 2012."},{"key":"e_1_3_2_1_3_1","volume-title":"Finite difference stencils implemented using chapel. ORNL TM-2007\/122","author":"Barrett R. F.","year":"2007","unstructured":"R. F. Barrett , P. C. Roth , and S. W. Poole . Finite difference stencils implemented using chapel. ORNL TM-2007\/122 , 2007 . R. F. Barrett, P. C. Roth, and S. W. Poole. Finite difference stencils implemented using chapel. ORNL TM-2007\/122, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.70"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.21236\/AD0646553","volume-title":"Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem","author":"Dantzig G. B.","year":"1966","unstructured":"G. B. Dantzig , W. Blattner , and M. Rao . Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem . 1966 . G. B. Dantzig, W. Blattner, and M. Rao. Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. 1966."},{"key":"e_1_3_2_1_8_1","volume-title":"SC","author":"Datta K.","year":"2008","unstructured":"K. Datta , M. Murphy , V. Volkov , S. Williams , J. Carter , L. Oliker , D. Patterson , J. Shalf , and K. Yelick . Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures . In SC , 2008 . K. Datta, M. Murphy, V. Volkov, S. Williams, J. Carter, L. Oliker, D. Patterson, J. Shalf, and K. Yelick. Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures. In SC, 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2458523.2458526"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2011.94"},{"key":"e_1_3_2_1_11_1","volume-title":"Stencil Domain Specific Language (SDSL) User Guide 0.2.1 draft. OSU TR OSU-CISRC-4\/13-TR09","author":"Henretty T.","year":"2013","unstructured":"T. Henretty , J. Holewinski , N. Sedaghati , L.-N. Pouchet , A. Rountev , and P. Sadayappan . Stencil Domain Specific Language (SDSL) User Guide 0.2.1 draft. OSU TR OSU-CISRC-4\/13-TR09 , 2013 . T. Henretty, J. Holewinski, N. Sedaghati, L.-N. Pouchet, A. Rountev, and P. Sadayappan. Stencil Domain Specific Language (SDSL) User Guide 0.2.1 draft. OSU TR OSU-CISRC-4\/13-TR09, 2013."},{"key":"e_1_3_2_1_12_1","volume-title":"CC","author":"Henretty T.","year":"2011","unstructured":"T. Henretty , K. Stock , L.-N. Pouchet , F. Franchetti , J. Ramanujam , and P. Sadayappan . Data layout transformation for stencil computations on short-vector SIMD architectures . In CC , 2011 . T. Henretty, K. Stock, L.-N. Pouchet, F. Franchetti, J. Ramanujam, and P. Sadayappan. Data layout transformation for stencil computations on short-vector SIMD architectures. In CC, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304619"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250761"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513895.1513905"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2009.44"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810096"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989508"},{"key":"e_1_3_2_1_19_1","volume-title":"Efficient multicore-aware parallelization strategies for iterative stencil computations. ArXiv e-prints","author":"Treibig J.","year":"2010","unstructured":"J. Treibig , G. Wellein , and G. Hager . Efficient multicore-aware parallelization strategies for iterative stencil computations. ArXiv e-prints , 2010 . J. Treibig, G. Wellein, and G. Hager. Efficient multicore-aware parallelization strategies for iterative stencil computations. ArXiv e-prints, 2010."}],"event":{"name":"ICS'13: International Conference on Supercomputing","location":"Eugene Oregon USA","acronym":"ICS'13","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 27th international ACM conference on International conference on supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464996.2467268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2464996.2467268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:00Z","timestamp":1750235940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464996.2467268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,10]]},"references-count":19,"alternative-id":["10.1145\/2464996.2467268","10.1145\/2464996"],"URL":"https:\/\/doi.org\/10.1145\/2464996.2467268","relation":{},"subject":[],"published":{"date-parts":[[2013,6,10]]},"assertion":[{"value":"2013-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}