{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:58:07Z","timestamp":1781193487073,"version":"3.54.1"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>\n            With the introduction of the Adaptive Intelligence Engine (AIE), the Versal Adaptive Compute Acceleration Platform (Versal ACAP) has garnered great attention. However, the current focus of Vitis Libraries and limited research has mainly been on how to invoke AIE modules, without delving into a thorough discussion on effectively utilizing AIE in its typical use cases. As a result, the widespread adoption of Versal ACAP has been restricted. The Communication Avoidance (CA) algorithm is considered a typical application within the AIE architecture. Nevertheless, the effective utilization of AIE in CA applications remains an area that requires further exploration. We propose a top-down customized design framework,\n            <jats:bold>EA4RCA<\/jats:bold>\n            (Efficient AIE accelerator design framework for regular Communication-Avoiding Algorithm), specifically tailored for CA algorithms with regular communication patterns, and equipped with AIE Graph Code Generator software to accelerate the AIE design process. The primary objective of this framework is to maximize the performance of AIE while incorporating high-speed data streaming services. Experiments show that for the RCA algorithm Filter2D and Matrix Multiple (MM) with lower communication requirements and the RCA algorithm FFT with higher communication requirements, the accelerators implemented by the RA4RCA framework achieve the highest throughput improvements of 22.19\u00d7, 1.05\u00d7, and 3.88\u00d7 compared with the current highest performance acceleration scheme (SOTA), and the highest energy efficiency improvements of 6.11\u00d7, 1.30\u00d7 and 7.00\u00d7.\n          <\/jats:p>","DOI":"10.1145\/3678010","type":"journal-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T11:03:29Z","timestamp":1721041409000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["EA4RCA: Efficient AIE accelerator design framework for regular Communication-Avoiding Algorithm"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8601-802X","authenticated-orcid":false,"given":"Wenbo","family":"Zhang","sequence":"first","affiliation":[{"name":"Faculty of Information, Beijing University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8262-2185","authenticated-orcid":false,"given":"Yiqi","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Information, Beijing University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6514-8266","authenticated-orcid":false,"given":"Tianhao","family":"Zang","sequence":"additional","affiliation":[{"name":"Faculty of Information, Beijing University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4714-8312","authenticated-orcid":false,"given":"Zhenshan","family":"Bao","sequence":"additional","affiliation":[{"name":"Faculty of Information, Beijing University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"AMD\/XILINX. 2023. Vitis Accelerated Libraries. Retrieved from https:\/\/github.com\/Xilinx\/Vitis_Libraries\/tree\/main"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2019.8875639"},{"key":"e_1_3_2_4_2","unstructured":"AMD\/XILINX. 2023. Customized Computing Challenge 2023. Retrieved from https:\/\/ccfsys-ccc.github.io\/2023\/"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00072"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543622.3573047"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3203217.3203267"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM57271.2023.00029"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373087.3375296"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.COMPANION.2012.351"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605604"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293906"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISICIR.2014.7029571"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISICIR.2014.7029571"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM57271.2023.00033"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00018"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM57271.2023.00023"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL57034.2022.00041"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM57271.2023.00032"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL57034.2022.00061"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/PDP59025.2023.00043"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-40843-4_44"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3625005"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS55109.2022.00030"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI48211.2021.9434068"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593708"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2018.032271058"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593719"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/357401.357403"},{"key":"e_1_3_2_30_2","article-title":"A fast fourier transform subroutine for ILLIAC IV","author":"Stevens J.","year":"1971","unstructured":"J. Stevens. 1971. A fast fourier transform subroutine for ILLIAC IV. CAC Document 1, 17 (1971), 1\u201367.","journal-title":"CAC Document"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988527"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER52292.2023.00024"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293908"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2019.00016"},{"issue":"90","key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex fourier series","volume":"19","author":"Tukey Cooley John W.","year":"1965","unstructured":"Cooley John W. Tukey. 1965. An algorithm for the machine calculation of complex fourier series. Math. Comp. 19, 90 (1965), 297\u2013301.","journal-title":"Math. Comp."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3294007"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3188255"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0706862","article-title":"QUANTIZATION EFFECTS IN DIGITAL FILTERS","author":"Weinstein Clifford J.","year":"1969","unstructured":"Clifford J. Weinstein. 1969. QUANTIZATION EFFECTS IN DIGITAL FILTERS. Quantization Effects in Digital Filters (1969).","journal-title":"Quantization Effects in Digital Filters"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2019.00030"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323754"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2022.01.004"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/S42514-021-00078-5"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL57034.2022.00040"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL57034.2022.00029"},{"key":"e_1_3_2_45_2","article-title":"A new multichannel parallel real-time FFT algorithm for a solar radio observation system based on FPGA","author":"Zhang Yuan Y.","year":"2022","unstructured":"Yuan Y. Zhang, Lei Zhang, Zi Q. Shang, Yan R. Su, Zhao Wu, and Fa B. Yan. 2022. A new multichannel parallel real-time FFT algorithm for a solar radio observation system based on FPGA. Publications of the Astronomical Society of the Pacific 134, 1033 (2022), 034502.","journal-title":"Publications of the Astronomical Society of the Pacific"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605148"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3472456.3472524"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543622.3573210"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678010","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3678010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:08Z","timestamp":1750287248000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,19]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3678010"],"URL":"https:\/\/doi.org\/10.1145\/3678010","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,19]]},"assertion":[{"value":"2024-03-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}