{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:10:10Z","timestamp":1782969010155,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,26]],"date-time":"2017-06-26T00:00:00Z","timestamp":1498435200000},"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":[],"published-print":{"date-parts":[[2017,6,26]]},"DOI":"10.1145\/3078597.3078616","type":"proceedings-article","created":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T12:46:51Z","timestamp":1498222011000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":108,"title":["To Push or To Pull"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Podstawski","sequence":"additional","affiliation":[{"name":"Perform Group Katowice & Katowice Institute of Information Technologies, Katowice, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Linus","family":"Groner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edgar","family":"Solomonik","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"e_1_3_2_1_2_1","first-page":"39","volume-title":"Proc. Symp. (IPDPS)","author":"Bader D. A.","unstructured":"D. A. Bader and G. Cong . Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Par. and Dist . Proc. Symp. (IPDPS) , page 39 . IEEE, 2004. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Par. and Dist. Proc. Symp. (IPDPS), page 39. IEEE, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/702694"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833187"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_29"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513272"},{"key":"e_1_3_2_1_8_1","volume-title":"O jist\u00e9m probl\u00e9mu minim\u00e1ln\u0131m","author":"Boruvka O.","year":"1926","unstructured":"O. Boruvka . O jist\u00e9m probl\u00e9mu minim\u00e1ln\u0131m . 1926 . O. Boruvka. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u0131m. 1926."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/297805.297827"},{"key":"e_1_3_2_1_11_1","first-page":"118","volume-title":"Proc. of the Intl. Par. & Dist. Proc. Symp., IPDPS '01","author":"Catalyurek U.","unstructured":"U. Catalyurek and C. Aykanat . A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices . In Proc. of the Intl. Par. & Dist. Proc. Symp., IPDPS '01 , pages 118 --, 2001. U. Catalyurek and C. Aykanat. A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices. In Proc. of the Intl. Par. & Dist. Proc. Symp., IPDPS '01, pages 118--, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.96"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to Algorithms . McGraw-Hill Higher Education , 2 nd edition, 2001 . T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2nd edition, 2001.","edition":"2"},{"issue":"5","key":"e_1_3_2_1_14_1","first-page":"1","article-title":"The igraph software package for complex network research. InterJournal","volume":"1695","author":"Csardi G.","year":"2006","unstructured":"G. Csardi and T. Nepusz . The igraph software package for complex network research. InterJournal , Complex Systems , 1695 ( 5 ): 1 -- 9 , 2006 . G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems, 1695(5):1--9, 2006.","journal-title":"Complex Systems"},{"key":"e_1_3_2_1_15_1","volume-title":"A survey of parallel graph processing frameworks","author":"Doekemeijer N.","year":"2014","unstructured":"N. Doekemeijer and A. L. Varbanescu . A survey of parallel graph processing frameworks . Delft University of Technology , 2014 . N. Doekemeijer and A. L. Varbanescu. A survey of parallel graph processing frameworks. Delft University of Technology, 2014."},{"key":"e_1_3_2_1_16_1","first-page":"482","article-title":"On the evolution of random graphs","volume":"2","author":"Erdos P.","year":"1976","unstructured":"P. Erdos and A. R\u00e9nyi . On the evolution of random graphs . Selected Papers of Alfr\u00e9d R\u00e9nyi , 2 : 482 -- 525 , 1976 . P. Erdos and A. R\u00e9nyi. On the evolution of random graphs. Selected Papers of Alfr\u00e9d R\u00e9nyi, 2:482--525, 1976.","journal-title":"Selected Papers of Alfr\u00e9d R\u00e9nyi"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804339"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90164-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-5511-3_9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503286"},{"key":"e_1_3_2_1_21_1","volume-title":"Complexity measures for map-reduce, and comparison to parallel computing. arXiv preprint arXiv:1211.6526","author":"Goel A.","year":"2012","unstructured":"A. Goel and K. Munagala . Complexity measures for map-reduce, and comparison to parallel computing. arXiv preprint arXiv:1211.6526 , 2012 . A. Goel and K. Munagala. Complexity measures for map-reduce, and comparison to parallel computing. arXiv preprint arXiv:1211.6526, 2012."},{"key":"e_1_3_2_1_22_1","first-page":"2","volume-title":"OSDI","volume":"12","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez : Distributed Graph-Parallel Computation on Natural Graphs . In OSDI , volume 12 , page 2 , 2012 . J. E. Gonzalez et al. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI, volume 12, page 2, 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"Branch-Avoiding Graph Algorithms. arXiv preprint arXiv:1411.1460","author":"Green O.","year":"2014","unstructured":"O. Green , M. Dukhan , and R. Vuduc . Branch-Avoiding Graph Algorithms. arXiv preprint arXiv:1411.1460 , 2014 . O. Green, M. Dukhan, and R. Vuduc. Branch-Avoiding Graph Algorithms. arXiv preprint arXiv:1411.1460, 2014."},{"key":"e_1_3_2_1_24_1","volume-title":"The parallel BGL: A generic library for distributed graph computations. Par. Obj.-Or. Scientific Comp. (POOSC), page 2","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The parallel BGL: A generic library for distributed graph computations. Par. Obj.-Or. Scientific Comp. (POOSC), page 2 , 2005 . D. Gregor and A. Lumsdaine. The parallel BGL: A generic library for distributed graph computations. Par. Obj.-Or. Scientific Comp. (POOSC), page 2, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/176979.176984"},{"key":"e_1_3_2_1_26_1","unstructured":"Intel Inc. 64 and IA-32 Architectures Software Developer's Manual 2015.  Intel Inc. 64 and IA-32 Architectures Software Developer's Manual 2015."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"Kepner J.","year":"2011","unstructured":"J. Kepner and J. Gilbert . Graph algorithms in the language of linear algebra , volume 22 . SIAM , 2011 . J. Kepner and J. Gilbert. Graph algorithms in the language of linear algebra, volume 22. SIAM, 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810534"},{"key":"e_1_3_2_1_31_1","volume-title":"Kronecker graphs: An approach to modeling networks. J. of Machine Learning Research, 11(Feb):985--1042","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec Kronecker graphs: An approach to modeling networks. J. of Machine Learning Research, 11(Feb):985--1042 , 2010 . J. Leskovec et al. Kronecker graphs: An approach to modeling networks. J. of Machine Learning Research, 11(Feb):985--1042, 2010."},{"key":"e_1_3_2_1_32_1","volume-title":"Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990","author":"Low Y.","year":"2010","unstructured":"Y. Low Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990 , 2010 . Y. Low et al. Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990, 2010."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_36_1","volume-title":"Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393","author":"Mattson T.","year":"2014","unstructured":"T. Mattson Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393 , 2014 . T. Mattson et al. Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393, 2014."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_38_1","unstructured":"Michael Voss (Intel). Understanding the Internals of tbb::graph : Balancing Push and Pull.  Michael Voss (Intel). Understanding the Internals of tbb::graph : Balancing Push and Pull."},{"key":"e_1_3_2_1_39_1","first-page":"3","article-title":"A Message-Passing Interface Standard","author":"Forum MPI","year":"2012","unstructured":"MPI Forum .textsfMPI : A Message-Passing Interface Standard . Version 3 , 2012 . MPI Forum.textsfMPI: A Message-Passing Interface Standard. Version 3, 2012.","journal-title":"Version"},{"key":"e_1_3_2_1_40_1","volume-title":"Introducing the graph 500","author":"Murphy R. C.","year":"2010","unstructured":"R. C. Murphy Introducing the graph 500 . Cray User's Group (CUG) , 2010 . R. C. Murphy et al. Introducing the graph 500. Cray User's Group (CUG), 2010."},{"key":"e_1_3_2_1_41_1","volume-title":"USENIX Annual Technical Conference","volume":"12","author":"Prabhakaran V.","year":"2012","unstructured":"V. Prabhakaran Managing large graphs on multi-cores with graph awareness . In USENIX Annual Technical Conference , volume 12 , 2012 . V. Prabhakaran et al. Managing large graphs on multi-cores with graph awareness. In USENIX Annual Technical Conference, volume 12, 2012."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442521"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2010.17"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253543"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882938"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48096-0_34"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_54_1","first-page":"2","volume-title":"Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing . In Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12 , pages 2 -- 2 , 2012 . M. Zaharia et al. Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing. In Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12, pages 2--2, 2012."},{"key":"e_1_3_2_1_55_1","volume-title":"USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16)","author":"Zhang M.","year":"2016","unstructured":"M. Zhang Exploring the hidden dimension in graph processing . In USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16) , 2016 . M. Zhang et al. Exploring the hidden dimension in graph processing. In USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16), 2016."},{"key":"e_1_3_2_1_57_1","volume-title":"USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16)","author":"Zhu X.","year":"2016","unstructured":"X. Zhu : A computation-centric distributed graph processing system . In USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16) , 2016 . X. Zhu et al. Gemini: A computation-centric distributed graph processing system. In USENIX Symp. on Op. Sys. Des. and Impl. (OSDI 16), 2016."}],"event":{"name":"HPDC '17: The 26th International Symposium on High-Performance Parallel and Distributed Computing","location":"Washington DC USA","acronym":"HPDC '17","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078597.3078616","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3078597.3078616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:15Z","timestamp":1750215795000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078597.3078616"}},"subtitle":["On Reducing Communication and Synchronization in Graph Computations"],"short-title":[],"issued":{"date-parts":[[2017,6,26]]},"references-count":55,"alternative-id":["10.1145\/3078597.3078616","10.1145\/3078597"],"URL":"https:\/\/doi.org\/10.1145\/3078597.3078616","relation":{},"subject":[],"published":{"date-parts":[[2017,6,26]]},"assertion":[{"value":"2017-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}