{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:46:44Z","timestamp":1755802004638,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T00:00:00Z","timestamp":1699747200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2209563"],"award-info":[{"award-number":["OAC-2209563"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019923","name":"DEVCOM Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF2220159"],"award-info":[{"award-number":["W911NF2220159"]}],"id":[{"id":"10.13039\/100019923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Meta Platforms Inc.","award":["INB2675366"],"award-info":[{"award-number":["INB2675366"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3624062.3624169","type":"proceedings-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:53:39Z","timestamp":1699624419000},"page":"922-931","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Distributed Graph Engine for Deep Learning on Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6827-0256","authenticated-orcid":false,"given":"Gangda","family":"Deng","sequence":"first","affiliation":[{"name":"University of Southern California (USC), United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5344-8386","authenticated-orcid":false,"given":"\u00d6mer Faruk","family":"Akg\u00fcl","sequence":"additional","affiliation":[{"name":"University of Southern California (USC), United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8158-3081","authenticated-orcid":false,"given":"Hongkuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Southern California (USC), United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2578-2147","authenticated-orcid":false,"given":"Hanqing","family":"Zeng","sequence":"additional","affiliation":[{"name":"Meta, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8155-5440","authenticated-orcid":false,"given":"Yinglong","family":"Xia","sequence":"additional","affiliation":[{"name":"Meta, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7586-9673","authenticated-orcid":false,"given":"Jianbo","family":"Li","sequence":"additional","affiliation":[{"name":"Meta, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1609-8589","authenticated-orcid":false,"given":"Viktor","family":"Prasanna","sequence":"additional","affiliation":[{"name":"University of Southern California (USC), United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,11,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, 1334\u20131343","author":"Chen Jie","year":"2018","unstructured":"Jie Chen, Xing Xie, Shuo Zhou, Jiaxin Huang, Bin Qin, and Wenwu Zhu. 2018. Scalable Personalized PageRank Estimation via Graph Partitioning. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, 1334\u20131343."},{"key":"e_1_3_2_2_4_1","volume-title":"Scalable graph neural networks via bidirectional propagation. Advances in neural information processing systems 33","author":"Chen Ming","year":"2020","unstructured":"Ming Chen, Zhewei Wei, Bolin Ding, Yaliang Li, Ye Yuan, Xiaoyong Du, and Ji-Rong Wen. 2020. Scalable graph neural networks via bidirectional propagation. Advances in neural information processing systems 33 (2020), 14556\u201314566."},{"key":"e_1_3_2_2_5_1","volume-title":"Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan\u00a0Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 (2019)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_2_7_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Gasteiger Johannes","year":"2018","unstructured":"Johannes Gasteiger, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_8_1","volume-title":"Diffusion improves graph learning. Advances in neural information processing systems 32","author":"Gasteiger Johannes","year":"2019","unstructured":"Johannes Gasteiger, Stefan Wei\u00dfenberger, and Stephan G\u00fcnnemann. 2019. Diffusion improves graph learning. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_2_9_1","volume-title":"Graphx: Graph processing in a distributed dataflow framework. In 11th { USENIX} Symposium on Operating Systems Design and Implementation ({ OSDI} 14). 599\u2013613.","author":"Gonzalez E","year":"2014","unstructured":"Joseph\u00a0E Gonzalez, Reynold\u00a0S Xin, Ankur Dave, Daniel Crankshaw, Michael\u00a0J Franklin, and Ion Stoica. 2014. Graphx: Graph processing in a distributed dataflow framework. In 11th { USENIX} Symposium on Operating Systems Design and Implementation ({ OSDI} 14). 599\u2013613."},{"key":"e_1_3_2_2_10_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems 30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_2_11_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33 (2020), 22118\u201322133."},{"key":"e_1_3_2_2_12_1","unstructured":"Wenzel Jakob Jason Rhinelander and Dean Moldovan. 2017. pybind11 \u2013 Seamless operability between C++11 and Python. https:\/\/github.com\/pybind\/pybind11."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the 12th international conference on World Wide Web. ACM, 405\u2013412","author":"Kamvar D","year":"2003","unstructured":"Sepandar\u00a0D Kamvar, Taher\u00a0H Haveliwala, and Gene\u00a0H Golub. 2003. Exploiting the block structure of the web for computing pagerank. In Proceedings of the 12th international conference on World Wide Web. ACM, 405\u2013412."},{"key":"e_1_3_2_2_16_1","volume-title":"International Conference on Peer-to-Peer Computing. IEEE.","author":"Kamvar D","year":"2003","unstructured":"Sepandar\u00a0D Kamvar, Matthew\u00a0T Schlosser, and Hector Garcia-Molina. 2003. Eigentrust: A trust-based reputation system for peer-to-peer networks. In International Conference on Peer-to-Peer Computing. IEEE."},{"key":"e_1_3_2_2_17_1","volume-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices.","author":"Karypis George","year":"1997","unstructured":"George Karypis and Vipin Kumar. 1997. METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. (1997)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623745"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the IEEE, Vol.\u00a099","author":"Mahoney W","year":"2011","unstructured":"Michael\u00a0W Mahoney. 2011. Randomized algorithms for matrices and data. In Proceedings of the IEEE, Vol.\u00a099. IEEE, 1588\u20131601."},{"key":"e_1_3_2_2_20_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web.Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_2_21_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020)."},{"key":"e_1_3_2_2_22_1","volume-title":"Parallel local graph clustering. arXiv preprint arXiv:1604.07515","author":"Shun Julian","year":"2016","unstructured":"Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, and Michael\u00a0W Mahoney. 2016. Parallel local graph clustering. arXiv preprint arXiv:1604.07515 (2016)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_2_24_1","volume-title":"ICLR workshop on representation learning on graphs and manifolds.","author":"Wang Minjie\u00a0Yu","year":"2019","unstructured":"Minjie\u00a0Yu Wang. 2019. Deep graph library: Towards efficient and scalable deep learning on graphs. In ICLR workshop on representation learning on graphs and manifolds."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning. 6861\u20136871","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Tianyi Zhang, Alejandro\u00a0L Souza\u00a0Jr, Chris Fifty, Tao Yu, and Kilian\u00a0Q Weinberger. 2019. Simplifying graph convolutional networks. In Proceedings of the 36th International Conference on Machine Learning. 6861\u20136871."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457298"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_30_1","volume-title":"Hierarchical graph representation learning with differentiable pooling. Advances in neural information processing systems 31","author":"Ying Rex","year":"2018","unstructured":"Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William\u00a0L Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. Advances in neural information processing systems 31 (2018), 4800\u20134810."},{"key":"e_1_3_2_2_31_1","first-page":"19665","article-title":"Decoupling the depth and scope of graph neural networks","volume":"34","author":"Zeng Hanqing","year":"2021","unstructured":"Hanqing Zeng, Muhan Zhang, Yinglong Xia, Ajitesh Srivastava, Andrey Malevich, Rajgopal Kannan, Viktor Prasanna, Long Jin, and Ren Chen. 2021. Decoupling the depth and scope of graph neural networks. Advances in Neural Information Processing Systems 34 (2021), 19665\u201319679.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_32_1","volume-title":"Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931","author":"Zeng Hanqing","year":"2019","unstructured":"Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan, and Viktor Prasanna. 2019. Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931 (2019)."},{"key":"e_1_3_2_2_33_1","volume-title":"Proceedings of the 13th ACM International Conference on Web Search and Data Mining. ACM, 279\u2013287","author":"Zhang Yuan","year":"2020","unstructured":"Yuan Zhang and William\u00a0W Cohen. 2020. Shadow: scalable personalized PageRank estimation for large social graphs. In Proceedings of the 13th ACM International Conference on Web Search and Data Mining. ACM, 279\u2013287."}],"event":{"name":"SC-W 2023: Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis","acronym":"SC-W 2023","location":"Denver CO USA"},"container-title":["Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3624169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624062.3624169","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624062.3624169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T03:03:00Z","timestamp":1755745380000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3624169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,12]]},"references-count":33,"alternative-id":["10.1145\/3624062.3624169","10.1145\/3624062"],"URL":"https:\/\/doi.org\/10.1145\/3624062.3624169","relation":{},"subject":[],"published":{"date-parts":[[2023,11,12]]},"assertion":[{"value":"2023-11-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}