{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T09:08:11Z","timestamp":1781255291093,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"RealTek","award":["NTHU-RealTek-2022-2023"],"award-info":[{"award-number":["NTHU-RealTek-2022-2023"]}]},{"name":"Taiwan NSTC","award":["RISC-V-2022-2025"],"award-info":[{"award-number":["RISC-V-2022-2025"]}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Google-NTHU-2022-2023"],"award-info":[{"award-number":["Google-NTHU-2022-2023"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,7]]},"DOI":"10.1145\/3605731.3605904","type":"proceedings-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T23:50:00Z","timestamp":1694130600000},"page":"79-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Enhancing LLVM Optimizations for Linear Recurrence Programs on RVV"],"prefix":"10.1145","author":[{"given":"Hung-Ming","family":"Lai","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jenq-Kuen","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan-Shin","family":"Hwang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"1986. The Livermore Fortran Kernels: A Computer Test of the Numerical Performance Range. (1986)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2022.3184867"},{"key":"e_1_3_2_1_3_1","volume-title":"Vector models for data-parallel computing. Vol.\u00a02","author":"Blelloch E","unstructured":"Guy\u00a0E Blelloch. 1990. Vector models for data-parallel computing. Vol.\u00a02. MIT press Cambridge."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1184\/R1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1988.44642"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/773473.178255"},{"key":"e_1_3_2_1_7_1","volume-title":"Optimizing parallel reduction in CUDA. Nvidia developer technology 2, 4","author":"Mark Harris","year":"2007","unstructured":"Mark Harris 2007. Optimizing parallel reduction in CUDA. Nvidia developer technology 2, 4 (2007), 70."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/7902.7903"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243204"},{"key":"e_1_3_2_1_10_1","volume-title":"Whole-Function Vectorization. In Proceedings of the 9th Annual IEEE\/ACM International Symposium on Code Generation and Optimization(CGO \u201911)","author":"Karrenberg Ralf","year":"2011","unstructured":"Ralf Karrenberg and Sebastian Hack. 2011. Whole-Function Vectorization. In Proceedings of the 9th Annual IEEE\/ACM International Symposium on Code Generation and Optimization(CGO \u201911). IEEE Computer Society, USA, 141\u2013150."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3547276.3548518"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3714"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.94"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1988.44651"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3148173.3148191"}],"event":{"name":"ICPP-W 2023: 52nd International Conference on Parallel Processing Workshops","location":"Salt Lake City UT USA","acronym":"ICPP-W 2023"},"container-title":["Proceedings of the 52nd International Conference on Parallel Processing Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605731.3605904","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605731.3605904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:10Z","timestamp":1750178770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605731.3605904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":18,"alternative-id":["10.1145\/3605731.3605904","10.1145\/3605731"],"URL":"https:\/\/doi.org\/10.1145\/3605731.3605904","relation":{},"subject":[],"published":{"date-parts":[[2023,8,7]]},"assertion":[{"value":"2023-09-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}