{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T17:27:03Z","timestamp":1786210023273,"version":"3.56.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"China NSF","doi-asserted-by":"publisher","award":["62427801"],"award-info":[{"award-number":["62427801"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"China NSF","doi-asserted-by":"publisher","award":["62031009"],"award-info":[{"award-number":["62031009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&#x0026;D Program of China","doi-asserted-by":"publisher","award":["2023YFB4502802"],"award-info":[{"award-number":["2023YFB4502802"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fudan-ZTE Joint Lab"},{"name":"Alibaba Research Fellow (ARF) Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tc.2025.3588317","type":"journal-article","created":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T17:43:43Z","timestamp":1752255823000},"page":"3419-3432","source":"Crossref","is-referenced-by-count":2,"title":["GATe: Efficient Graph Attention Network Acceleration With Near-Memory Processing"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0744-358X","authenticated-orcid":false,"given":"Shiyan","family":"Yi","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6770-3681","authenticated-orcid":false,"given":"Yudi","family":"Qiu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3436-5298","authenticated-orcid":false,"given":"Guohao","family":"Xu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6416-6474","authenticated-orcid":false,"given":"Lingfei","family":"Lu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3986-137X","authenticated-orcid":false,"given":"Xiaoyang","family":"Zeng","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2523-8261","authenticated-orcid":false,"given":"Yibo","family":"Fan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Velickovic","year":"2018"},{"key":"ref2","article-title":"How attentive are graph attention networks?","author":"Brody","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2023.3305668"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2023.3326170"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102602"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3559009.3569670"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2023.3283677"},{"key":"ref8","article-title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","author":"Wang","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"ref10","article-title":"Online normalizer calculation for softmax","author":"Milakov","year":"2018"},{"key":"ref11","first-page":"16344","article-title":"FlashAttention: Fast and memory-efficient exact attention with IO-awareness","volume-title":"Proc. 35th Int. Conf. Neural Inf. Process. Syst.","author":"Dao","year":"2022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS48785.2022.9937238"},{"key":"ref13","first-page":"467","article-title":"Understanding GNN computational graph: A coordinated computation, IO, and memory perspective","volume-title":"Proc. 5th Conf. Mach. Learn. Syst.","author":"Zhang","year":"2022"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2020.2973991"},{"key":"ref15","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. 33nd Int. Conf. Mach. Learn.","volume":"48","author":"Yang","year":"2016"},{"key":"ref16","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"Hu","year":"2020"},{"key":"ref17","first-page":"28","article-title":"Cacti 6.0: A tool to model large caches","volume":"27","author":"Muralimanohar","year":"2009","journal-title":"HP Lab"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00070"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00076"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00057"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/PACT58117.2023.00020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD53106.2021.00092"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00079"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00070"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3014632"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323898"},{"key":"ref28","first-page":"645","article-title":"NTGAT: A graph attention network acceleration with runtime node tailoring","volume-title":"Proc. 28th Asia South Pacific Des. Automat. Conf.","author":"Hou","year":"2023"},{"key":"ref29","first-page":"1","article-title":"Workload-balanced graph attention network accelerator with top-k aggregation candidates","volume-title":"Proc. 41st IEEE\/ACM Int. Conf. Comput.-Aided Des.","author":"Park","year":"2022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00093"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247735"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC42614.2022.9731694"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2821565"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.54"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358284"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480080"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3579371.3589101"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3097700"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2019.8875680"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00059"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00080"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480090"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA53966.2022.00082"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00030"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2024.3386734"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/12\/11164542\/11078437.pdf?arnumber=11078437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:33:39Z","timestamp":1758044019000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11078437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tc.2025.3588317","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}