{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:47:20Z","timestamp":1782481640468,"version":"3.54.5"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T00:00:00Z","timestamp":1782432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Hunan Science and Technology Innovation Program","award":["2024RC3125"],"award-info":[{"award-number":["2024RC3125"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>The demand for real-time streaming graph analysis has grown significantly, as hundreds of thousands of updates come every second. Monotonic graph algorithms such as Shortest Path are widely used in real-time analytics, but there are two bottlenecks that limit their performance, specially on planar graphs. One is massive redundant data accesses due to irregular state propagations and the other is high memory latency caused by irregular data accesses. We observe that existing systems mainly focus on general-purpose graph algorithms. If the properties of specific graph algorithms are exploited, the analysis performance can be further improved. Moreover, these systems typically tackle these two bottlenecks separately through either software or hardware mechanisms, but not both. However, both bottlenecks need to be addressed simultaneously in real scenarios such as road navigation.<\/jats:p>\n                  <jats:p>This article proposes WSGraph, a software-hardware co-design framework for high-performance streaming graph processing. WSGraph tackles these two challenges by enforcing regularized processing orders and enabling precise data prefetching. Specifically, at the software level, WSGraph integrates a priority-based work scheduler with sliding-window bucket mapping scheme to regulate state propagations, thereby drastically reducing redundant data accesses. At the hardware level, WSGraph incorporates a lightweight in-core Proactive Data Engine (PDE). By exploiting intra-vertex access regularity, the PDE accurately prefetches relevant graph data to effectively hide the high latency of irregular memory accesses. Experimental results demonstrate that WSGraph achieves significant performance improvements over existing systems. Compared with the state-of-the-art software system KickStarter, WSGraph gains a 2.13\u00d7 speedup primarily by reducing graph data accesses by an average of 78.6%.<\/jats:p>","DOI":"10.1145\/3803023","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:06:09Z","timestamp":1776078369000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["WSGraph: A Framework for Tackling Redundant and Irregular Data Access in Streaming Graph Processing"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5218-1478","authenticated-orcid":false,"given":"Xuanyi","family":"Li","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Advanced Microprocessor Chips and Systems, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0684-1754","authenticated-orcid":false,"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Advanced Microprocessor Chips and Systems, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8188-6450","authenticated-orcid":false,"given":"Zhengyi","family":"Dai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2558-8800","authenticated-orcid":false,"given":"Xiaowen","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Advanced Microprocessor Chips and Systems, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3049-5573","authenticated-orcid":false,"given":"Jianzhuang","family":"Lu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Advanced Microprocessor Chips and Systems, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9050-0866","authenticated-orcid":false,"given":"Yang","family":"Guo","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Advanced Microprocessor Chips and Systems, National University of Defense Technology","place":["Changsha, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,26]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2024. 39 Twitter Statistics Marketers Need to Know in 2024. Retrieved November 30 2025 from https:\/\/www.wordstream.com\/blog\/ws\/2020\/04\/14\/twitter-statistics"},{"key":"e_1_3_2_3_2","unstructured":"2024. DDR4 SDRAM System Power Calculator. Retrieved July 1 2025 from https:\/\/www.micron.com\/content\/dam\/micron\/global\/secure\/products\/power-calculator\/ddr4-power-calc.xlsm"},{"key":"e_1_3_2_4_2","unstructured":"2024. SNAP Datasets: Stanford large network dataset collection. Retrieved July 1 2025 from http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926254"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2017.7863749"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378498"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS48437.2020.00012"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480096"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Michael A. Bender and Haodong Hu. 2007. An adaptive packed-memory array. ACM Transactions on Database Systems 32 4 Article 26 (Nov. 2007) 43.","DOI":"10.1145\/1292609.1292616"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00050"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3576173"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Tianlun Dai Wenchao Zheng Jiayue Sun Cun Ji Tao Zhou Mingtong Li Wei Hu and Ziqiang Yu. 2020. Continuous route planning over a dynamic graph in real-time. In Proceedia Computer Science 2019 International Conference on Identification Information and Knowledge in the Internet of Things 174 (2020) 111\u2013114. DOI:10.1016\/j.procs.2020.06.065","DOI":"10.1016\/j.procs.2020.06.065"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Laxman Dhulipala Guy E. Blelloch Yan Gu and Yihan Sun. 2022. PaC-trees: Supporting parallel and compressed purely-functional collections. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI\u201922). Association for Computing Machinery New York NY USA. DOI:10.1145\/3519939.3523733","DOI":"10.1145\/3519939.3523733"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314598"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457263"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1992.697004"},{"key":"e_1_3_2_22_2","article-title":"Graphs Dataset Collection","author":"Fuentes J.","year":"2025","unstructured":"J. Fuentes. 2025. Graphs Dataset Collection. Retrieved December 04, 2025 from http:\/\/www.inf.udec.cl\/ jfuentess\/datasets\/graphs.php","journal-title":"Retrieved December 04, 2025 from http:\/\/www.inf.udec.cl\/ jfuentess\/datasets\/graphs.php"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461550"},{"key":"e_1_3_2_24_2","article-title":"Inductive Representation Learning on Large Graphs","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. Retrieved November 30, 2025 from https:\/\/paperswithcode.com\/dataset\/reddit","journal-title":"Retrieved November 30, 2025 from https:\/\/paperswithcode.com\/dataset\/reddit"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542349"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540730"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456226"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247904"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3439803"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3364180"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669172"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105405"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113298"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456230"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303974"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317804"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2016.7446087"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00072"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457313"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3650076"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480126"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2508148.2485963"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_24"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267811"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882950"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2016.25"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555766"},{"key":"e_1_3_2_52_2","doi-asserted-by":"crossref","unstructured":"TomTom. 2025. Real-Time Traffic Data and Traffic Stats. Retrieved November 30 2025 from https:\/\/www.tomtom.com\/products\/traffic-apis\/","DOI":"10.12968\/S1356-9252(25)40062-8"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3431920.3439288"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547566"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00212"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830807"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3335880"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","unstructured":"Yunming Zhang Ajay Brahmakshatriya Xinyi Chen Laxman Dhulipala Shoaib Kamil Saman Amarasinghe and Julian Shun. 2020. Optimizing ordered graph algorithms with graphIt. In Proceedings of the 18th ACM\/IEEE International Symposium on Code Generation and Optimization (CGO\u201920). Association for Computing Machinery New York NY USA 158\u2013170. DOI:10.1145\/3368826.3377909","DOI":"10.1145\/3368826.3377909"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527409"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3803023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T12:56:40Z","timestamp":1782478600000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3803023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,26]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3803023"],"URL":"https:\/\/doi.org\/10.1145\/3803023","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,26]]},"assertion":[{"value":"2025-12-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}