{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:41:12Z","timestamp":1773193272040,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T00:00:00Z","timestamp":1570838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1657333, CCF-1717754, CNS-1717984, CCF-750656, CCF-1919289"],"award-info":[{"award-number":["CCF-1657333, CCF-1717754, CNS-1717984, CCF-750656, CCF-1919289"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,10,12]]},"DOI":"10.1145\/3352460.3358256","type":"proceedings-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T11:16:45Z","timestamp":1570792605000},"page":"712-725","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":125,"title":["GraphQ"],"prefix":"10.1145","author":[{"given":"Youwei","family":"Zhuo","sequence":"first","affiliation":[{"name":"University of Southern California"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Southern California"}]},{"given":"Mingxing","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"Beihang University"}]},{"given":"Dimin","family":"Niu","sequence":"additional","affiliation":[{"name":"Alibaba Inc"}]},{"given":"Yanzhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Xuehai","family":"Qian","sequence":"additional","affiliation":[{"name":"University of Southern California"}]}],"member":"320","published-online":{"date-parts":[[2019,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_2_1_2_1","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Ai Zhiyuan","year":"2017","unstructured":"Zhiyuan Ai, Mingxing Zhang, Yongwei Wu, Xuehai Qian, Kang Chen, and Weimin Zheng. 2017. Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk i\/o. In 2017 USENIX Annual Technical Conference (USENIX ATC 17). USENIX Association, Santa Clara, CA. 125--137."},{"key":"e_1_3_2_1_3_1","volume-title":"Graph-based methods for analysing networks in cell biology. Briefings in bioinformatics 7, 3","author":"Aittokallio Tero","year":"2006","unstructured":"Tero Aittokallio and Benno Schwikowski. 2006. Graph-based methods for analysing networks in cell biology. Briefings in bioinformatics 7, 3 (2006), 243--255."},{"key":"e_1_3_2_1_4_1","unstructured":"Andrei Alexandrescu and Katrin Kirchhoff. 2007. Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP.. In HLT-NAACL. 204--211."},{"key":"e_1_3_2_1_5_1","unstructured":"ARM. 2009. ARM Cortex-A5 Processor. http:\/\/www.arm.com\/products\/processors\/cortex-a\/cortex-a5.php."},{"key":"e_1_3_2_1_6_1","volume-title":"Analysis and Optimization of the Memory Hierarchy for Graph Processing Workloads. In 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 373--386","author":"Basak Abanti","year":"2019","unstructured":"Abanti Basak, Shuangchen Li, Xing Hu, Sang Min Oh, Xinfeng Xie, Li Zhao, Xiaowei Jiang, and Yuan Xie. 2019. Analysis and Optimization of the Memory Hierarchy for Graph Processing Workloads. In 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 373--386."},{"key":"e_1_3_2_1_7_1","volume-title":"On a routing problem. Quarterly of applied mathematics 16, 1","author":"Bellman Richard","year":"1958","unstructured":"Richard Bellman. 1958. On a routing problem. Quarterly of applied mathematics 16, 1 (1958), 87--90."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_9_1","first-page":"61","article-title":"Social network analysis with content and graphs","volume":"20","author":"Campbell William M","year":"2013","unstructured":"William M Campbell, Charlie K Dagli, and Clifford J Weinstein. 2013. Social network analysis with content and graphs. Lincoln Laboratory Journal 20, 1 (2013), 61--81.","journal-title":"Lincoln Laboratory Journal"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_1_12_1","unstructured":"Hybrid Memory Cube Consortium et al. 2015. Hybrid memory cube specification version 2.1. Technical Report."},{"key":"e_1_3_2_1_13_1","volume-title":"Graphh: A processing-in-memory architecture for large-scale graph processing","author":"Dai Guohao","year":"2018","unstructured":"Guohao Dai, Tianhao Huang, Yuze Chi, Jishen Zhao, Guangyu Sun, Yongpan Liu, Yu Wang, Yuan Xie, and Huazhong Yang. 2018. Graphh: A processing-in-memory architecture for large-scale graph processing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2018)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.75"},{"key":"e_1_3_2_1_15_1","volume-title":"A note on two problems in connexion with graphs. Numerische mathematik 1, 1","author":"Dijkstra Edsger W","year":"1959","unstructured":"Edsger W Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959), 269--271."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.9.853"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.22"},{"key":"e_1_3_2_1_19_1","volume-title":"Powergraph: Distributed graph-parallel computation on natural graphs. In Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12). 17--30.","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. In Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12). 17--30."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, 1069--1080","author":"Goyal Amit","year":"2012","unstructured":"Amit Goyal, Hal Daum\u00e9 III, and Raul Guerra. 2012. Fast large-scale approximate graph construction for nlp. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, 1069--1080."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572034"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3195638.3195707"},{"key":"e_1_3_2_1_23_1","unstructured":"Hybrid Memory Cube Consortium. 2015. Hybrid Memory Cube Specification 2.1."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830777"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2010.2091686"},{"key":"e_1_3_2_1_26_1","volume-title":"High-Level Programming Abstractions for Distributed Graph Processing. CoRR abs\/1607.02646","author":"Kalavri Vasiliki","year":"2016","unstructured":"Vasiliki Kalavri, Vladimir Vlassov, and Seif Haridi. 2016. High-Level Programming Abstractions for Distributed Graph Processing. CoRR abs\/1607.02646 (2016). http:\/\/arxiv.org\/abs\/1607.02646"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2523721.2523744"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_29_1","unstructured":"Nicolas Le Novere Michael Hucka Huaiyu Mi Stuart Moodie Falk Schreiber Anatoly Sorokin Emek Demir Katja Wegner Mirit I Aladjem Sarala M Wimalaratne et al. 2009. The systems biology graphical notation. Nature biotechnology 27 8 (2009) 735--741."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807632"},{"key":"e_1_3_2_1_31_1","volume-title":"Solid-State Circuits Conference Digest of Technical Papers (ISSCC)","author":"Lee Dong Uk","year":"2014","unstructured":"Dong Uk Lee, Kyung Whan Kim, Kwan Weon Kim, Hongjung Kim, Ju Young Kim, Young Jun Park, Jae Hwan Kim, Dae Suk Kim, Heat Bit Park, Jin Wook Shin, et al. 2014. 25.2 A 1.2 V 8Gb 8-channel 128GB\/s high-bandwidth memory (HBM) stacked DRAM with effective microbump I\/O test methods using 29nm process and TSV. In Solid-State Circuits Conference Digest of Technical Papers (ISSCC), 2014 IEEE International. IEEE, 432--433."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_34_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. friendster. https:\/\/snap.stanford.edu\/data\/com-Friendster.html"},{"key":"e_1_3_2_1_35_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_37_1","volume-title":"MICRO 42: Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture. 469--480","author":"Li Sheng","unstructured":"Sheng Li, Jung Ho Ahn, Richard D. Strong, Jay B. Brockman, Dean M. Tullsen, and Norman P. Jouppi. 2009. McPAT: An Integrated Power, Area, and Timing Modeling Framework for Multicore and Manycore Architectures. In MICRO 42: Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture. 469--480."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.202"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810091"},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS'12)","author":"McAuley Julian","year":"2012","unstructured":"Julian McAuley and Jure Leskovec. 2012. Learning to Discover Social Circles in Ego Networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS'12). Curran Associates Inc., USA, 539--547. http:\/\/dl.acm.org\/citation.cfm?id=2999134.2999195"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021819901281"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00010"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.54"},{"key":"e_1_3_2_1_47_1","volume-title":"International Workshop on Rack-Scale Computing (WRSC w\/EuroSys).","author":"Nelson Jacob","year":"2014","unstructured":"Jacob Nelson, Brandon Holt, Brandon Myers, Preston Briggs, Luis Ceze, Simon Kahan, and Mark Oskin. 2014. Grappa: A latency-tolerant runtime for large-scale irregular applications. In International Workshop on Rack-Scale Computing (WRSC w\/EuroSys)."},{"key":"e_1_3_2_1_48_1","unstructured":"NIST (National Institute of Standards and Technology). 2000. Matrix Market. https:\/\/math.nist.gov\/MatrixMarket\/index.html."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.24"},{"key":"e_1_3_2_1_50_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: bringing order to the web. (1999)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.11.002"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485963"},{"key":"e_1_3_2_1_54_1","volume-title":"Quantifying the potential benefit of overlapping communication and computation in large-scale scientific applications. In |","author":"Sancho Jos\u00e9 Carlos","unstructured":"Jos\u00e9 Carlos Sancho, Kevin J Barker, Darren J Kerbyson, and Kei Davis. 2006. Quantifying the potential benefit of overlapping communication and computation in large-scale scientific applications. In |. IEEE, 17."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540726"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994522"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2016.16"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282501"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840840"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/61.19245"},{"key":"e_1_3_2_1_63_1","volume-title":"Managing and Mining Graph Data","author":"Tang Lei","unstructured":"Lei Tang and Huan Liu. 2010. Graph mining applications to social network analysis. In Managing and Mining Graph Data. Springer, 487--513."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140659.3080214"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjdc.2.598"},{"key":"e_1_3_2_1_66_1","volume-title":"Sai Charan Koduru, and Rajiv Gupta","author":"Vora Keval","year":"2014","unstructured":"Keval Vora, Sai Charan Koduru, and Rajiv Gupta. 2014. ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM. In ACM SIGPLAN Notices, Vol. 49. ACM, 861--878."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"e_1_3_2_1_68_1","first-page":"29","article-title":"Study of network security evaluation based on attack graph model","volume":"28","author":"Wang Yong-Jie","year":"2007","unstructured":"Yong-Jie Wang, Ming Xian, Jin Liu, and Guo-yu Wang. 2007. Study of network security evaluation based on attack graph model. JOURNAL-CHINA INSTITUTE OF COMMUNICATIONS 28, 3 (2007), 29.","journal-title":"JOURNAL-CHINA INSTITUTE OF COMMUNICATIONS"},{"key":"e_1_3_2_1_69_1","volume-title":"The 14th USENIX Symposium on Networked Systems Design and Implementation.","author":"Xiao Wencong","year":"2017","unstructured":"Wencong Xiao, Jilong Xue, Youshan Miao, Zhen Li, Cheng Chen, Ming Wu, Wei Li, and Lidong Zhou. 2017. Tux2: Distributed Graph Computation for Machine Learning. In The 14th USENIX Symposium on Networked Systems Design and Implementation."},{"key":"e_1_3_2_1_70_1","volume-title":"Proceedings of the TextGraphs-2 Workshop (NAACL-HLT","author":"Zesch Torsten","year":"2007","unstructured":"Torsten Zesch and Iryna Gurevych. 2007. Analysis of the Wikipedia category graph for NLP applications. In Proceedings of the TextGraphs-2 Workshop (NAACL-HLT 2007). 1--8."},{"key":"e_1_3_2_1_71_1","volume-title":"Exploring the Hidden Dimension in Graph Processing. In The 12th USENIX Symposium on Operating Systems Design and Implementation.","author":"Zhang Mingxing","year":"2016","unstructured":"Mingxing Zhang, Yongwei Wu, Kang Chen, Xuehai Qian, Xue Li, and Weimin Zheng. 2016. Exploring the Hidden Dimension in Graph Processing. In The 12th USENIX Symposium on Operating Systems Design and Implementation."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00053"},{"key":"e_1_3_2_1_73_1","volume-title":"Gemini: A Computation-Centric Distributed Graph Processing System.. In OSDI. 301--316.","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A Computation-Centric Distributed Graph Processing System.. In OSDI. 301--316."},{"key":"e_1_3_2_1_74_1","volume-title":"2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). 375--386."}],"event":{"name":"MICRO '52: The 52nd Annual IEEE\/ACM International Symposium on Microarchitecture","location":"Columbus OH USA","acronym":"MICRO '52","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","IEEE CS"]},"container-title":["Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3352460.3358256","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3352460.3358256","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3352460.3358256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T22:27:38Z","timestamp":1753828058000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3352460.3358256"}},"subtitle":["Scalable PIM-Based Graph Processing"],"short-title":[],"issued":{"date-parts":[[2019,10,12]]},"references-count":74,"alternative-id":["10.1145\/3352460.3358256","10.1145\/3352460"],"URL":"https:\/\/doi.org\/10.1145\/3352460.3358256","relation":{},"subject":[],"published":{"date-parts":[[2019,10,12]]},"assertion":[{"value":"2019-10-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}