{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:57:26Z","timestamp":1764842246126,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"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-1750399"],"award-info":[{"award-number":["CCF-1750399"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Economy, Industry and Competitiveness of Spain","award":["TIN2016-75845-P AEI\/FEDER\/EU"],"award-info":[{"award-number":["TIN2016-75845-P AEI\/FEDER\/EU"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,8]]},"DOI":"10.1145\/3314221.3314615","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"625-639","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Generating piecewise-regular code from irregular structures"],"prefix":"10.1145","author":[{"given":"Travis","family":"Augustine","sequence":"first","affiliation":[{"name":"Colorado State University, USA"}]},{"given":"Janarthanan","family":"Sarma","sequence":"additional","affiliation":[{"name":"Colorado State University, USA"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[{"name":"Colorado State University, USA"}]},{"given":"Gabriel","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Universidade da Coru\u00f1a, Spain"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207157"},{"volume-title":"Fast Sparse Matrix-vector Multiplication on GPUs for Graph Applications. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC","author":"Ashari A.","key":"e_1_3_2_2_2_1","unstructured":"A. Ashari , N. Sedaghati , J. Eisenlohr , S. Parthasarathy , and P. Sadayappan . 2014 . Fast Sparse Matrix-vector Multiplication on GPUs for Graph Applications. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC . New Orleans, LA, USA, 781\u015b792. A. Ashari, N. Sedaghati, J. Eisenlohr, S. Parthasarathy, and P. Sadayappan. 2014. Fast Sparse Matrix-vector Multiplication on GPUs for Graph Applications. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. New Orleans, LA, USA, 781\u015b792."},{"key":"e_1_3_2_2_3_1","volume-title":"Code Generation in the Polyhedral Model Is Easier Than You Think. In 13th International Conference on Parallel Architectures and Compilation Techniques, PACT. IEEE","author":"Bastoul C.","year":"2004","unstructured":"C. Bastoul . 2004 . Code Generation in the Polyhedral Model Is Easier Than You Think. In 13th International Conference on Parallel Architectures and Compilation Techniques, PACT. IEEE , Antibes, France, 7\u015b16. C. Bastoul. 2004. Code Generation in the Polyhedral Model Is Easier Than You Think. In 13th International Conference on Parallel Architectures and Compilation Techniques, PACT. IEEE, Antibes, France, 7\u015b16."},{"key":"e_1_3_2_2_4_1","unstructured":"N. Bell and M. Garland. 2008. Efficient Sparse Matrix-Vector Multiplication on CUDA. NVIDIA Technical Report NVR-2008-004. NVIDIA Corporation.  N. Bell and M. Garland. 2008. Efficient Sparse Matrix-Vector Multiplication on CUDA. NVIDIA Technical Report NVR-2008-004. NVIDIA Corporation."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126936"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00065"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693471"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2006.54"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_38"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224420"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11428831_13"},{"volume-title":"An Alternative Compressed Storage Format for Sparse Matrices. In Intl. Symposium on Computer Science and Information Sciences, ISCIS","author":"Ekambaram A.","key":"e_1_3_2_2_15_1","unstructured":"A. Ekambaram and E. Montagne . 2003 . An Alternative Compressed Storage Format for Sparse Matrices. In Intl. Symposium on Computer Science and Information Sciences, ISCIS . Antalya, Turkey, 196\u015b203. A. Ekambaram and E. Montagne. 2003. An Alternative Compressed Storage Format for Sparse Matrices. In Intl. Symposium on Computer Science and Information Sciences, ISCIS. Antalya, Turkey, 196\u015b203."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2159430.2159436"},{"key":"e_1_3_2_2_17_1","unstructured":"R.G. Grimes D.R. Kincaid and D.M. Young. 1980. ITPACK 2.0: User\u2019s Guide. http:\/\/books.google.com\/books?id=h8RcNAAACAAJ  R.G. Grimes D.R. Kincaid and D.M. Young. 1980. ITPACK 2.0: User\u2019s Guide. http:\/\/books.google.com\/books?id=h8RcNAAACAAJ"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229478"},{"key":"e_1_3_2_2_19_1","unstructured":"S. Han J. Pool J. Tran and W. Dally. 2015. Learning both Weights and Connections for Efficient Neural Network. In Advances in Neural Information Processing Systems NIPS. Quebec Canada 1135\u015b1143.   S. Han J. Pool J. Tran and W. Dally. 2015. Learning both Weights and Connections for Efficient Neural Network. In Advances in Neural Information Processing Systems NIPS. Quebec Canada 1135\u015b1143."},{"key":"e_1_3_2_2_20_1","unstructured":"B. Hassibi and D.G. Stork. 1992. Second Order Derivatives for Network Pruning: Optimal Brain Surgeon. In Advances in Neural Information Processing Systems NIPS. Denver CO USA 164\u015b171.   B. Hassibi and D.G. Stork. 1992. Second Order Derivatives for Network Pruning: Optimal Brain Surgeon. In Advances in Neural Information Processing Systems NIPS. Denver CO USA 164\u015b171."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356058.1356071"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_2_2_23_1","unstructured":"A. LaMielle and M. Strout. 2010. Enabling Code Generation within the Sparse Polyhedral Framework. Technical Report. Colorado State University.  A. LaMielle and M. Strout. 2010. Enabling Code Generation within the Sparse Polyhedral Framework. Technical Report. Colorado State University."},{"key":"e_1_3_2_2_24_1","unstructured":"Y. LeCun C. Cortes and C. Burges. {n. d.}. The MNIST Database of Handwritten Digits. http:\/\/yann.lecun.com\/exdb\/mnist\/ . Last accessed: April 2019.  Y. LeCun C. Cortes and C. Burges. {n. d.}. The MNIST Database of Handwritten Digits. http:\/\/yann.lecun.com\/exdb\/mnist\/ . Last accessed: April 2019."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169752"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926449"},{"volume-title":"Distributed Memory Code Generation for Mixed Irregular\/Regular Computations. In 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP. ACM","author":"Ravishankar M.","key":"e_1_3_2_2_27_1","unstructured":"M. Ravishankar , R. Dathathri , V. Elango , L.-N. Pouchet , J. Ramanujam , A. Rountev , and P. Sadayappan . 2015 . Distributed Memory Code Generation for Mixed Irregular\/Regular Computations. In 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP. ACM , San Francisco, CA, USA, 65\u015b75. M. Ravishankar, R. Dathathri, V. Elango, L.-N. Pouchet, J. Ramanujam, A. Rountev, and P. Sadayappan. 2015. Distributed Memory Code Generation for Mixed Irregular\/Regular Computations. In 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP. ACM, San Francisco, CA, USA, 65\u015b75."},{"key":"e_1_3_2_2_28_1","volume-title":"Polyhedral Modeling of Immutable Sparse Matrices. In 8th International Workshop on Polyhedral Compilation Techniques","author":"Rodr\u00edguez G.","year":"2018","unstructured":"G. Rodr\u00edguez and L.-N. Pouchet . 2018 . Polyhedral Modeling of Immutable Sparse Matrices. In 8th International Workshop on Polyhedral Compilation Techniques . Manchester, UK. G. Rodr\u00edguez and L.-N. Pouchet. 2018. Polyhedral Modeling of Immutable Sparse Matrices. In 8th International Workshop on Polyhedral Compilation Techniques. Manchester, UK."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854038.2854056"},{"key":"e_1_3_2_2_30_1","article-title":"Affine Modeling of Program Traces","volume":"68","author":"Rodr\u00edguez G.","year":"2018","unstructured":"G. Rodr\u00edguez , M. T. Kandemir , and J. Touri\u00f1o . 2018 . Affine Modeling of Program Traces . ACM. Trans. Comput. 68 , 2 (2018), 294\u015b300. G. Rodr\u00edguez, M. T. Kandemir, and J. Touri\u00f1o. 2018. Affine Modeling of Program Traces. ACM. Trans. Comput. 68, 2 (2018), 294\u015b300.","journal-title":"ACM. Trans. Comput."},{"key":"e_1_3_2_2_31_1","volume-title":"SPARSKIT: A basic tool kit for sparse matrix computations.","author":"Saad Y.","year":"1990","unstructured":"Y. Saad . 1990 . SPARSKIT: A basic tool kit for sparse matrix computations. (1990). Y. Saad. 1990. SPARSKIT: A basic tool kit for sparse matrix computations. (1990)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/78041.78042"},{"volume-title":"Run-time and Compile-time Support for Adaptive Irregular Problems. In ACM\/IEEE Conference on Supercomputing, SC","author":"Sharma S.","key":"e_1_3_2_2_33_1","unstructured":"S. Sharma , R. Ponnusamy , B. Moon , Y.-S. Hwang , R. Das , and J. Saltz . 1994 . Run-time and Compile-time Support for Adaptive Irregular Problems. In ACM\/IEEE Conference on Supercomputing, SC . Washington, DC, USA, 97\u015b106. S. Sharma, R. Ponnusamy, B. Moon, Y.-S. Hwang, R. Das, and J. Saltz. 1994. Run-time and Compile-time Support for Adaptive Irregular Problems. In ACM\/IEEE Conference on Supercomputing, SC. Washington, DC, USA, 97\u015b106."},{"volume-title":"Set and Relation Manipulation for the Sparse Polyhedral Framework. In 25th International Workshop on Languages and Compilers for Parallel Computing, LCPC","author":"Strout M.M.","key":"e_1_3_2_2_34_1","unstructured":"M.M. Strout , G. George , and C. Olschanowsky . 2012 . Set and Relation Manipulation for the Sparse Polyhedral Framework. In 25th International Workshop on Languages and Compilers for Parallel Computing, LCPC . Tokyo, Japan, 61\u015b75. M.M. Strout, G. George, and C. Olschanowsky. 2012. Set and Relation Manipulation for the Sparse Polyhedral Framework. In 25th International Workshop on Languages and Compilers for Parallel Computing, LCPC. Tokyo, Japan, 61\u015b75."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2838734"},{"volume-title":"13th Annual IEEE\/ACM International Symposium on Code Generation and Optimization","author":"Tang W.T.","key":"e_1_3_2_2_36_1","unstructured":"W.T. Tang , R. Zhao , M. Lu , Y. Liang , H.P. Huynh , X. Li , and R.S.M. Goh . 2015. Optimizing and Auto-tuning Scale-free Sparse Matrixvector Multiplication on Intel Xeon Phi . In 13th Annual IEEE\/ACM International Symposium on Code Generation and Optimization , CGO. IEEE Computer Society , San Francisco, CA, USA , 136\u015b145. W.T. Tang, R. Zhao, M. Lu, Y. Liang, H.P. Huynh, X. Li, and R.S.M. Goh. 2015. Optimizing and Auto-tuning Scale-free Sparse Matrixvector Multiplication on Intel Xeon Phi. In 13th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO. IEEE Computer Society, San Francisco, CA, USA, 136\u015b145."},{"volume-title":"Automating Wavefront Parallelization for Sparse Matrix Computations. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC","author":"Venkat A.","key":"e_1_3_2_2_37_1","unstructured":"A. Venkat , M.S. Mohammadi , J. Park , H. Rong , R. Barik , M.M. Strout , and M. Hall . 2016 . Automating Wavefront Parallelization for Sparse Matrix Computations. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC . Salt Lake City, UT, USA, Article 41. A. Venkat, M.S. Mohammadi, J. Park, H. Rong, R. Barik, M.M. Strout, and M. Hall. 2016. Automating Wavefront Parallelization for Sparse Matrix Computations. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. Salt Lake City, UT, USA, Article 41."},{"volume-title":"6th International Workshop on Languages and Compilers for Parallel Computing, LCPC","author":"von Hanxleden R.","key":"e_1_3_2_2_38_1","unstructured":"R. von Hanxleden , K. Kennedy , C. Koelbel , R. Das , and J. Saltz . 1992. Compiler analysis for irregular problems in Fortran D . In 6th International Workshop on Languages and Compilers for Parallel Computing, LCPC . New Haven, CT, USA, 97\u015b111. R. von Hanxleden, K. Kennedy, C. Koelbel, R. Das, and J. Saltz. 1992. Compiler analysis for irregular problems in Fortran D. In 6th International Workshop on Languages and Compilers for Parallel Computing, LCPC. New Haven, CT, USA, 97\u015b111."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.12.006"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555255"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938548"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Phoenix AZ USA","acronym":"PLDI '19"},"container-title":["Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314615","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:22Z","timestamp":1750204402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":41,"alternative-id":["10.1145\/3314221.3314615","10.1145\/3314221"],"URL":"https:\/\/doi.org\/10.1145\/3314221.3314615","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}