{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:38Z","timestamp":1750220198275,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"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":[[2022,4,2]]},"DOI":"10.1145\/3528425.3529103","type":"proceedings-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T22:18:42Z","timestamp":1650320322000},"page":"35-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Modeling optimization of stencil computations via domain-level properties"],"prefix":"10.1145","author":[{"given":"Brandon","family":"Nesterenko","sequence":"first","affiliation":[{"name":"University of Colorado Colorado Springs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Yi","sequence":"additional","affiliation":[{"name":"University of Colorado Colorado Springs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Hung","family":"Lin","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Liao","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brandon","family":"Runnels","sequence":"additional","affiliation":[{"name":"University of Colorado Colorado Springs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Allen-Cahn-2d. http:\/\/web.tuat.ac.jp\/\\~yamanaka\/pcoms2019\/Allen-Cahn-2d.html (Accessed on 08\/19\/2020).  [n.d.]. Allen-Cahn-2d. http:\/\/web.tuat.ac.jp\/\\~yamanaka\/pcoms2019\/Allen-Cahn-2d.html (Accessed on 08\/19\/2020)."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. C Codes. https:\/\/people.sc.fsu.edu\/ jburkardt\/c_src\/c_src.html (Accessed on 10\/18\/2020).  [n.d.]. C Codes. https:\/\/people.sc.fsu.edu\/ jburkardt\/c_src\/c_src.html (Accessed on 10\/18\/2020)."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Is division slower than multiplication? | searchivarius.org. http:\/\/searchivarius.org\/blog\/division-slower-multiplication (Accessed on 07\/06\/2020).  [n.d.]. Is division slower than multiplication? | searchivarius.org. http:\/\/searchivarius.org\/blog\/division-slower-multiplication (Accessed on 07\/06\/2020)."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. Multiple Linear Regression with Interactions | Introduction to Statistics | JMP. https:\/\/www.jmp.com\/en_us\/statistics-knowledge-portal\/what-is-multiple-regression\/mlr-with-interactions.html (Accessed on 10\/18\/2020).  [n.d.]. Multiple Linear Regression with Interactions | Introduction to Statistics | JMP. https:\/\/www.jmp.com\/en_us\/statistics-knowledge-portal\/what-is-multiple-regression\/mlr-with-interactions.html (Accessed on 10\/18\/2020)."},{"key":"e_1_3_2_1_5_1","unstructured":"2020. FD1DHEATEXPLICIT - Time Dependent 1D Heat Equation Finite Difference Explicit Time Stepping. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/fd1d_heat_explicit\/fd1d_heat_explicit.html (Accessed on 10\/02\/2020).  2020. FD1DHEATEXPLICIT - Time Dependent 1D Heat Equation Finite Difference Explicit Time Stepping. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/fd1d_heat_explicit\/fd1d_heat_explicit.html (Accessed on 10\/02\/2020)."},{"key":"e_1_3_2_1_6_1","unstructured":"2020. FD1DWAVE - Finite Difference Method 1D Wave Equation. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/fd1d_wave\/fd1d_wave.html (Accessed on 10\/02\/2020).  2020. FD1DWAVE - Finite Difference Method 1D Wave Equation. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/fd1d_wave\/fd1d_wave.html (Accessed on 10\/02\/2020)."},{"key":"e_1_3_2_1_7_1","unstructured":"2020. LAPLACIAN - The Discrete Laplacian Operator. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/laplacian\/laplacian.html (Accessed on 10\/02\/2020).  2020. LAPLACIAN - The Discrete Laplacian Operator. https:\/\/people.sc.fsu.edu\/ jburkardt\/cpp_src\/laplacian\/laplacian.html (Accessed on 10\/02\/2020)."},{"key":"e_1_3_2_1_8_1","article-title":"Diamond tiling: Tiling techniques to maximize parallelism for stencil computations","volume":"28","author":"Bondhugula Uday","year":"2016","unstructured":"Uday Bondhugula , Vinayaka Bandishti , and Irshad Pananilath . 2016 . Diamond tiling: Tiling techniques to maximize parallelism for stencil computations . IEEE Transactions on Parallel and Distributed Systems 28 , 5 (2016), 1285–1298. Uday Bondhugula, Vinayaka Bandishti, and Irshad Pananilath. 2016. Diamond tiling: Tiling techniques to maximize parallelism for stencil computations. IEEE Transactions on Parallel and Distributed Systems 28, 5 (2016), 1285–1298.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_1_9_1","volume-title":"Pluto: A practical and fully automatic polyhedral parallelizer and locality optimizer.","author":"Bondhugula Uday","year":"2007","unstructured":"Uday Bondhugula and Jagannathan Ramanujam . 2007 . Pluto: A practical and fully automatic polyhedral parallelizer and locality optimizer. (2007). Uday Bondhugula and Jagannathan Ramanujam. 2007. Pluto: A practical and fully automatic polyhedral parallelizer and locality optimizer. (2007)."},{"key":"e_1_3_2_1_10_1","volume-title":"International Workshop on Applied Parallel Computing. Springer, 173–183","author":"Garc Manuel","year":"2010","unstructured":"José María Cecilia, José Manuel Garc ía, and Manuel Ujald ón. 2010 . CUDA 2D stencil computations for the Jacobi method . In International Workshop on Applied Parallel Computing. Springer, 173–183 . José María Cecilia, José Manuel García, and Manuel Ujaldón. 2010. CUDA 2D stencil computations for the Jacobi method. In International Workshop on Applied Parallel Computing. Springer, 173–183."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Leonardo Dagum and Ramesh Menon. 1998. OpenMP: an industry standard API for shared-memory programming. IEEE computational science and engineering 5 1 (1998) 46–55.  Leonardo Dagum and Ramesh Menon. 1998. OpenMP: an industry standard API for shared-memory programming. IEEE computational science and engineering 5 1 (1998) 46–55.","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Steven Ellingson. 2018. Electromagnetics Volume 1 (beta). Virginia Tech Libraries.  Steven Ellingson. 2018. Electromagnetics Volume 1 (beta) . Virginia Tech Libraries.","DOI":"10.21061\/electromagnetics-vol-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.01370"},{"key":"e_1_3_2_1_14_1","volume-title":"Generation of finite difference formulas on arbitrarily spaced grids. Mathematics of computation 51, 184","author":"Fornberg Bengt","year":"1988","unstructured":"Bengt Fornberg . 1988. Generation of finite difference formulas on arbitrarily spaced grids. Mathematics of computation 51, 184 ( 1988 ), 699–706. Bengt Fornberg. 1988. Generation of finite difference formulas on arbitrarily spaced grids. Mathematics of computation 51, 184 (1988), 699–706."},{"key":"e_1_3_2_1_15_1","unstructured":"Danilo Guerrera. 2021. Stempel. https:\/\/github.com\/RRZE-HPC\/stempel  Danilo Guerrera. 2021. Stempel. https:\/\/github.com\/RRZE-HPC\/stempel"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2832087.2832092"},{"key":"e_1_3_2_1_17_1","unstructured":"Intel Intel. 64. and IA-32 Architectures Optimization Reference Manual September 2014.  Intel Intel. 64. and IA-32 Architectures Optimization Reference Manual September 2014."},{"key":"e_1_3_2_1_18_1","volume-title":"Effective automatic parallelization of stencil computations. ACM sigplan notices 42, 6","author":"Krishnamoorthy Sriram","year":"2007","unstructured":"Sriram Krishnamoorthy , Muthu Baskaran , Uday Bondhugula , Jagannathan Ramanujam , Atanas Rountev , and Ponnuswamy Sadayappan . 2007. Effective automatic parallelization of stencil computations. ACM sigplan notices 42, 6 ( 2007 ), 235–244. Sriram Krishnamoorthy, Muthu Baskaran, Uday Bondhugula, Jagannathan Ramanujam, Atanas Rountev, and Ponnuswamy Sadayappan. 2007. Effective automatic parallelization of stencil computations. ACM sigplan notices 42, 6 (2007), 235–244."},{"volume-title":"Automated instruction stream throughput prediction for intel and amd microarchitectures. In 2018 IEEE\/ACM performance modeling, benchmarking and simulation of high performance computer systems (PMBS)","author":"Laukemann Jan","key":"e_1_3_2_1_19_1","unstructured":"Jan Laukemann , Julian Hammer , Johannes Hofmann , Georg Hager , and Gerhard Wellein . 2018. Automated instruction stream throughput prediction for intel and amd microarchitectures. In 2018 IEEE\/ACM performance modeling, benchmarking and simulation of high performance computer systems (PMBS) . IEEE , 121–131. Jan Laukemann, Julian Hammer, Johannes Hofmann, Georg Hager, and Gerhard Wellein. 2018. Automated instruction stream throughput prediction for intel and amd microarchitectures. In 2018 IEEE\/ACM performance modeling, benchmarking and simulation of high performance computer systems (PMBS). IEEE, 121–131."},{"key":"e_1_3_2_1_20_1","volume-title":"International Workshop on Languages and Compilers for Parallel Computing. Springer, 137–152","author":"Lin Pei-Hung","year":"2016","unstructured":"Pei-Hung Lin , Qing Yi , Daniel Quinlan , Chunhua Liao , and Yongqing Yan . 2016 . Automatically optimizing stencil computations on many-core NUMA architectures . In International Workshop on Languages and Compilers for Parallel Computing. Springer, 137–152 . Pei-Hung Lin, Qing Yi, Daniel Quinlan, Chunhua Liao, and Yongqing Yan. 2016. Automatically optimizing stencil computations on many-core NUMA architectures. In International Workshop on Languages and Compilers for Parallel Computing. Springer, 137–152."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225132"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 8th ACM International Conference on Computing Frontiers. 1–10","author":"Faizur Rahman Shah M","year":"2011","unstructured":"Shah M Faizur Rahman , Qing Yi , and Apan Qasem . 2011 . Understanding stencil code performance on multicore architectures . In Proceedings of the 8th ACM International Conference on Computing Frontiers. 1–10 . Shah M Faizur Rahman, Qing Yi, and Apan Qasem. 2011. Understanding stencil code performance on multicore architectures. In Proceedings of the 8th ACM International Conference on Computing Frontiers. 1–10."},{"key":"e_1_3_2_1_23_1","article-title":"Multi-FPGA accelerator for scalable stencil computation with constant memory bandwidth","volume":"25","author":"Sano Kentaro","year":"2013","unstructured":"Kentaro Sano , Yoshiaki Hatsuda , and Satoru Yamamoto . 2013 . Multi-FPGA accelerator for scalable stencil computation with constant memory bandwidth . IEEE Transactions on Parallel and Distributed Systems 25 , 3 (2013), 695–705. Kentaro Sano, Yoshiaki Hatsuda, and Satoru Yamamoto. 2013. Multi-FPGA accelerator for scalable stencil computation with constant memory bandwidth. IEEE Transactions on Parallel and Distributed Systems 25, 3 (2013), 695–705.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_1_24_1","volume-title":"High performance stencil code algorithms for GPGPUs. Procedia Computer Science 4","author":"Sch Andreas","year":"2011","unstructured":"Andreas Sch äfer and Dietmar Fey . 2011. High performance stencil code algorithms for GPGPUs. Procedia Computer Science 4 ( 2011 ), 2027–2036. Andreas Schäfer and Dietmar Fey. 2011. High performance stencil code algorithms for GPGPUs. Procedia Computer Science 4 (2011), 2027–2036."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2751205.2751240"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989508"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/76263.76337"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370637"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.89"}],"event":{"name":"PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Seoul Republic of Korea","acronym":"PPoPP '22"},"container-title":["Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528425.3529103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528425.3529103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:43Z","timestamp":1750186963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528425.3529103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,2]]},"references-count":30,"alternative-id":["10.1145\/3528425.3529103","10.1145\/3528425"],"URL":"https:\/\/doi.org\/10.1145\/3528425.3529103","relation":{},"subject":[],"published":{"date-parts":[[2022,4,2]]},"assertion":[{"value":"2022-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}