{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:09Z","timestamp":1750220949066,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T00:00:00Z","timestamp":1550275200000},"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":[[2019,2,16]]},"DOI":"10.1145\/3302516.3307354","type":"proceedings-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T19:37:34Z","timestamp":1550173054000},"page":"17-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Enabling prefix sum parallelism pattern for recurrences with principled function reconstruction"],"prefix":"10.1145","author":[{"given":"Yang","family":"Xia","sequence":"first","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Peng","family":"Jiang","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Gagan","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,2,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. Parallel Prefix Sum. https:\/\/en.wikipedia.org\/wiki\/NC_(complexity).  {n. d.}. Parallel Prefix Sum. https:\/\/en.wikipedia.org\/wiki\/NC_(complexity)."},{"key":"e_1_3_2_1_2_1","unstructured":"Jens Breitbart. 2010.  Jens Breitbart. 2010."},{"volume-title":"European Conference on Parallel Processing. Springer, 373\u2013380","author":"Static GP","key":"e_1_3_2_1_3_1","unstructured":"Static GP U threads and an improved scan algorithm . In European Conference on Parallel Processing. Springer, 373\u2013380 . Static GP U threads and an improved scan algorithm. In European Conference on Parallel Processing. Springer, 373\u2013380."},{"volume-title":"Languages and Compilers for Parallel Computing","author":"Callahan D.","key":"e_1_3_2_1_4_1","unstructured":"D. Callahan . 1992. Recognizing and parallelizing bounded recurrences . In Languages and Compilers for Parallel Computing , Utpal Banerjee, David Gelernter, Alex Nicolau, and David Padua (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 169\u2013185. D. Callahan. 1992. Recognizing and parallelizing bounded recurrences. In Languages and Compilers for Parallel Computing, Utpal Banerjee, David Gelernter, Alex Nicolau, and David Padua (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 169\u2013185."},{"key":"e_1_3_2_1_5_1","unstructured":"Ernie Chan Marcel Heimlich Avi Purkayastha and Robert Van De Geijn. 2007.  Ernie Chan Marcel Heimlich Avi Purkayastha and Robert Van De Geijn. 2007."},{"key":"e_1_3_2_1_6_1","volume-title":"theory, practice, and experience. Concurrency and Computation: Practice and Experience 19, 13","author":"Collective","year":"2007","unstructured":"Collective communication : theory, practice, and experience. Concurrency and Computation: Practice and Experience 19, 13 ( 2007 ), 1749\u20131783. Collective communication: theory, practice, and experience. Concurrency and Computation: Practice and Experience 19, 13 (2007), 1749\u20131783."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250760"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375559"},{"key":"e_1_3_2_1_9_1","unstructured":"Azadeh Farzan and Victor Nicolet. 2017.  Azadeh Farzan and Victor Nicolet. 2017."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062355"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062382"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178255"},{"key":"e_1_3_2_1_13_1","unstructured":"Kshitij Gupta Jeff A Stuart and John D Owens. 2012.  Kshitij Gupta Jeff A Stuart and John D Owens. 2012."},{"key":"e_1_3_2_1_14_1","volume-title":"Innovative Parallel Computing-Foundations &amp","author":"A","year":"2012","unstructured":"A study of persistent threads style GP U programming for GPGP U workloads. In Innovative Parallel Computing-Foundations &amp ; Applications of GPU, Manycore , and Heterogeneous Systems (INPAR 2012 ). IEEE , 1\u201314. A study of persistent threads style GP U programming for GPGP U workloads. In Innovative Parallel Computing-Foundations & Applications of GPU, Manycore, and Heterogeneous Systems (INPAR 2012). IEEE, 1\u201314."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018760"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243204"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173162.3173168"},{"key":"e_1_3_2_1_19_1","unstructured":"Sepideh Maleki Annie Yang and Martin Burtscher. 2016.  Sepideh Maleki Annie Yang and Martin Burtscher. 2016."},{"key":"e_1_3_2_1_20_1","unstructured":"Higher-order and tuple-based massively-parallel prefix sums. Vol. 51. ACM.  Higher-order and tuple-based massively-parallel prefix sums. Vol. 51. ACM."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2654822.2541988"},{"key":"e_1_3_2_1_22_1","unstructured":"Junqiao Qiu Zhijia Zhao Bo Wu Abhinav Vishnu and Shuaiwen Leon Song. 2017.  Junqiao Qiu Zhijia Zhao Bo Wu Abhinav Vishnu and Shuaiwen Leon Song. 2017."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079082"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356058.1356082"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815418"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815418"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993554"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837855.1806663"},{"key":"e_1_3_2_1_29_1","volume-title":"2010 IEEE International Symposium on. IEEE, 1\u201312","author":"Xiao Shucai","year":"2010","unstructured":"Shucai Xiao and Wu-chun Feng. 2010 . Inter-block GP U communication via fast barrier synchronization. In Parallel & Distributed Processing (IPDPS) , 2010 IEEE International Symposium on. IEEE, 1\u201312 . Shucai Xiao and Wu-chun Feng. 2010. Inter-block GP U communication via fast barrier synchronization. In Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on. IEEE, 1\u201312."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442539"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775054.2694369"}],"event":{"name":"CC '19: 28th International Conference on Compiler Construction","acronym":"CC '19","location":"Washington DC USA"},"container-title":["Proceedings of the 28th International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302516.3307354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3302516.3307354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:55Z","timestamp":1750204435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302516.3307354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,16]]},"references-count":31,"alternative-id":["10.1145\/3302516.3307354","10.1145\/3302516"],"URL":"https:\/\/doi.org\/10.1145\/3302516.3307354","relation":{},"subject":[],"published":{"date-parts":[[2019,2,16]]},"assertion":[{"value":"2019-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}