{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:42Z","timestamp":1750220442415,"version":"3.41.0"},"reference-count":91,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:00:00Z","timestamp":1593475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["652976"],"award-info":[{"award-number":["652976"]}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/M025268\/1"],"award-info":[{"award-number":["EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Institute of Computing Sciences"},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61602023"],"award-info":[{"award-number":["61602023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Royal Society Wolfson Research Merit Award","award":["WRM\/R1\/180014"],"award-info":[{"award-number":["WRM\/R1\/180014"]}]},{"DOI":"10.13039\/501100015639","name":"Beijing Advanced Innovation Center for Big Data and Brain Computing","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100015639","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>This article proposes an Adaptive Asynchronous Parallel (AAP) model for graph computations. As opposed to Bulk Synchronous Parallel (BSP) and Asynchronous Parallel (AP) models, AAP reduces both stragglers and stale computations by dynamically adjusting relative progress of workers. We show that BSP, AP, and Stale Synchronous Parallel model (SSP) are special cases of AAP. Better yet, AAP optimizes parallel processing by adaptively switching among these models at different stages of a single execution. Moreover, employing the programming model of GRAPE, AAP aims to parallelize existing sequential algorithms based on simultaneous fixpoint computation with partial and incremental evaluation. Under a monotone condition, AAP guarantees to converge at correct answers if the sequential algorithms are correct. Furthermore, we show that AAP can optimally simulate MapReduce, PRAM, BSP, AP, and SSP. Using real-life and synthetic graphs, we experimentally verify that AAP outperforms BSP, AP, and SSP for a variety of graph computations.<\/jats:p>","DOI":"10.1145\/3397491","type":"journal-article","created":{"date-parts":[[2020,7,5]],"date-time":"2020-07-05T21:17:10Z","timestamp":1593983830000},"page":"1-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive Asynchronous Parallelization of Graph Algorithms"],"prefix":"10.1145","volume":"45","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh and Beihang University and SICS, Shenzhen University, Longhua, Shenzhen, China"}]},{"given":"Ping","family":"Lu","sequence":"additional","affiliation":[{"name":"BDBC, Beihang University, Beijing, China"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Jingbo","family":"Xu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Qiang","family":"Yin","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Xiaojian","family":"Luo","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4977-6646","authenticated-orcid":false,"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Ruochun","family":"Jin","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}]}],"member":"320","published-online":{"date-parts":[[2020,7,5]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2006. GTgraph. http:\/\/www.cse.psu.edu\/ kxm85\/software\/GTgraph\/.  2006. GTgraph. http:\/\/www.cse.psu.edu\/ kxm85\/software\/GTgraph\/."},{"key":"e_1_2_1_2_1","unstructured":"2006. UKWeb. http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06-2007-05\/.  2006. UKWeb. http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06-2007-05\/."},{"key":"e_1_2_1_3_1","unstructured":"2010. Traffic. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml.  2010. Traffic. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml."},{"key":"e_1_2_1_4_1","unstructured":"2011. Movielens. http:\/\/grouplens.org\/datasets\/movielens\/.  2011. Movielens. http:\/\/grouplens.org\/datasets\/movielens\/."},{"key":"e_1_2_1_5_1","unstructured":"2012. ClueWeb12. http:\/\/www.lemurproject.org\/clueweb12.php\/.  2012. ClueWeb12. http:\/\/www.lemurproject.org\/clueweb12.php\/."},{"key":"e_1_2_1_6_1","unstructured":"2012. Friendster. https:\/\/snap.stanford.edu\/data\/com-Friendster.html.  2012. Friendster. https:\/\/snap.stanford.edu\/data\/com-Friendster.html."},{"key":"e_1_2_1_7_1","unstructured":"2012. MPICH. https:\/\/www.mpich.org\/.  2012. MPICH. https:\/\/www.mpich.org\/."},{"key":"e_1_2_1_8_1","unstructured":"2014. Giraph. http:\/\/giraph.apache.org\/.  2014. Giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_2_1_9_1","unstructured":"2014. Timely Dataflow. https:\/\/github.com\/frankmcsherry\/timely-dataflow\/.  2014. Timely Dataflow. https:\/\/github.com\/frankmcsherry\/timely-dataflow\/."},{"key":"e_1_2_1_10_1","unstructured":"2015. COST. https:\/\/github.com\/frankmcsherry\/COST\/.  2015. COST. https:\/\/github.com\/frankmcsherry\/COST\/."},{"key":"e_1_2_1_11_1","unstructured":"2015. PageRank in timely dataflow. https:\/\/github.com\/frankmcsherry\/pagerank\/.  2015. PageRank in timely dataflow. https:\/\/github.com\/frankmcsherry\/pagerank\/."},{"key":"e_1_2_1_12_1","unstructured":"2017. Netflix Prize data. https:\/\/www.kaggle.com\/netflix-inc\/netflix-prize-data.  2017. Netflix Prize data. https:\/\/www.kaggle.com\/netflix-inc\/netflix-prize-data."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Umut A. Acar Arthur Chargu\u00e9raud and Mike Rainey. 2013. Scheduling parallel programs by work stealing with private deques. In PPoPP.  Umut A. Acar Arthur Chargu\u00e9raud and Mike Rainey. 2013. Scheduling parallel programs by work stealing with private deques. In PPoPP.","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324307"},{"volume-title":"Gutin","year":"2008","author":"Bang-Jensen Jrgen","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","unstructured":"Nguyen Thien Bao and Toyotaro Suzumura. 2013. Towards highly scalable pregel-based graph processing platform with x10. In WWW\u201913. 501--508.  Nguyen Thien Bao and Toyotaro Suzumura. 2013. Towards highly scalable pregel-based graph processing platform with x10. In WWW\u201913. 501--508."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2013.50"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11749-016-0481-7"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.10.007"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_2_1_25_1","first-page":"13","article-title":"Powerlyra: Differentiated graph computation and partitioning on skewed graphs","volume":"5","author":"Chen Rong","year":"2019","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"volume-title":"Daisy Zhe Wang, and Soumitra Siddharth Johri","year":"2016","author":"Chen Yang","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995162"},{"volume-title":"Xing","year":"2015","author":"Dai Wei","key":"e_1_2_1_28_1"},{"volume-title":"Gluon: A communication-optimizing substrate for distributed heterogeneous graph analytics. In PLDI. 752--768.","year":"2018","author":"Dathathri Roshan","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-3"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"James Dinan Stephen Olivier Gerald Sabin Jan Prins P. Sadayappan and Chau-Wen Tseng. 2007. Dynamic load balancing of unbalanced computations using message passing. In IPDPS.  James Dinan Stephen Olivier Gerald Sabin Jan Prins P. Sadayappan and Chau-Wen Tseng. 2007. Dynamic load balancing of unbalanced computations using message passing. In IPDPS.","DOI":"10.1109\/IPDPS.2007.370581"},{"key":"e_1_2_1_34_1","unstructured":"Wenfei Fan Chunming Hu and Chao Tian. 2017. Incremental graph computations: Doable and undoable. In SIGMOD.  Wenfei Fan Chunming Hu and Chao Tian. 2017. Incremental graph computations: Doable and undoable. In SIGMOD."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"W. Fan R. Jin M. Liu P. Lu X. Luo R. Xu Q. Yin W. Yu and J. Zhou. 2020. Application driven graph partitioning. In SIGMOD.  W. Fan R. Jin M. Liu P. Lu X. Luo R. Xu Q. Yin W. Yu and J. Zhou. 2020. Application driven graph partitioning. In SIGMOD.","DOI":"10.1145\/3318464.3389745"},{"key":"e_1_2_1_36_1","unstructured":"Wenfei Fan Ping Lu Xiaojian Luo Jingbo Xu Qiang Yin Wenyuan Yu and Ruiqi Xu. 2018. Adaptive asynchronous parallelization of graph algorithms. In SIGMOD. 1141--1156.  Wenfei Fan Ping Lu Xiaojian Luo Jingbo Xu Qiang Yin Wenyuan Yu and Ruiqi Xu. 2018. Adaptive asynchronous parallelization of graph algorithms. In SIGMOD. 1141--1156."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137801"},{"key":"e_1_2_1_38_1","unstructured":"Wenfei Fan Jingbo Xu Yinghui Wu Wenyuan Yu Jiaxin Jiang Bohan Zhang Zeyu Zheng Yang Cao and Chao Tian. 2017. Parallelizing sequential graph computations. In SIGMOD.  Wenfei Fan Jingbo Xu Yinghui Wu Wenyuan Yu Jiaxin Jiang Bohan Zhang Zeyu Zheng Yang Cao and Chao Tian. 2017. Parallelizing sequential graph computations. In SIGMOD."},{"volume-title":"Parallelizing sequential graph computations. TODS 43, 18","year":"2018","author":"Fan Wenfei","key":"e_1_2_1_39_1"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"volume-title":"The Elements of Statistical Learning","author":"Friedman Jerome","key":"e_1_2_1_41_1"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3800(02)00257-0"},{"key":"e_1_2_1_43_1","unstructured":"Joseph E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In USENIX.  Joseph E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In USENIX."},{"key":"e_1_2_1_44_1","unstructured":"Joseph E. Gonzalez Reynold S. Xin Ankur Dave Daniel Crankshaw Michael J. Franklin and Ion Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In OSDI.  Joseph E. Gonzalez Reynold S. Xin Ankur Dave Daniel Crankshaw Michael J. Franklin and Ion Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In OSDI."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"volume-title":"An experimental comparison of pregel-like graph processing systems. PVLDB 7, 12","year":"2014","author":"Han Minyang","key":"e_1_2_1_46_1"},{"volume-title":"Phillip B. Gibbons, Garth A. Gibson, Gregory R. Ganger, and Eric P. Xing.","year":"2013","author":"Ho Qirong","key":"e_1_2_1_47_1"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Frank Hutter Lin Xu Holger H. Hoos and Kevin Leyton-Brown. 2014. Algorithm\u00a0runtime prediction: Methods 8 evaluation. Artif. Intell. (2014) 79--111.  Frank Hutter Lin Xu Holger H. Hoos and Kevin Leyton-Brown. 2014. Algorithm\u00a0runtime prediction: Methods 8 evaluation. Artif. Intell. (2014) 79--111.","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Howard J. Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A model of computation for mapReduce. In SODA. 938--948.  Howard J. Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A model of computation for mapReduce. In SODA. 938--948.","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"volume-title":"SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices. Data 8 Knowledge Engineering 72","year":"2012","author":"Kim Mijung","key":"e_1_2_1_52_1"},{"volume-title":"Theory and Application of Infinite Series","author":"Knopp Konrad","key":"e_1_2_1_53_1"},{"volume-title":"SIGMOD.","author":"Ko Seongyun","key":"e_1_2_1_54_1"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"volume-title":"Alexander J. Smola, Amr Ahmed, Vanja Josifovski, James Long, Eugene J. Shekita, and Bor-Yiing Su.","year":"2014","author":"Li Mu","key":"e_1_2_1_56_1"},{"volume-title":"Hellerstein","year":"2012","author":"Low Yucheng","key":"e_1_2_1_57_1"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_2_1_60_1","unstructured":"Frank McSherry Michael Isard and Derek Gordon Murray. 2015. Scalability! But at what COST?. In HotOS.  Frank McSherry Michael Isard and Derek Gordon Murray. 2015. Scalability! But at what COST?. In HotOS."},{"key":"e_1_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Tom\u00e1\u0161 Mikolov Martin Karafi\u00e1t Luk\u00e1\u0161 Burget Jan \u010cernock\u1ef3 and Sanjeev Khudanpur. 2010. Recurrent neural network based language model. In INTERSPEECH.  Tom\u00e1\u0161 Mikolov Martin Karafi\u00e1t Luk\u00e1\u0161 Burget Jan \u010cernock\u1ef3 and Sanjeev Khudanpur. 2010. Recurrent neural network based language model. In INTERSPEECH.","DOI":"10.21437\/Interspeech.2010-343"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1117\/1.2819119"},{"key":"e_1_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Donald Nguyen Andrew Lenharth and Keshav Pingali. 2013. A lightweight infrastructure for graph analytics. In SOSP. 456--471.  Donald Nguyen Andrew Lenharth and Keshav Pingali. 2013. A lightweight infrastructure for graph analytics. In SOSP. 456--471.","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Heungsun Park and L. A. Stefanski. 1998. Relative-error prediction. Statistics 8 Probability Letters 40 3 (1998) 227--236.  Heungsun Park and L. A. Stefanski. 1998. Relative-error prediction. Statistics 8 Probability Letters 40 3 (1998) 227--236.","DOI":"10.1016\/S0167-7152(98)00088-1"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"volume-title":"GPS: A graph processing system. In SSDBM.","year":"2013","author":"Salihoglu Semih","key":"e_1_2_1_69_1"},{"key":"e_1_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Zechao Shang and Jeffrey Xu Yu. 2013. Catch the wind: Graph workload balancing on cloud. In ICDE. 553--564.  Zechao Shang and Jeffrey Xu Yu. 2013. Catch the wind: Graph workload balancing on cloud. In ICDE. 553--564.","DOI":"10.1109\/ICDE.2013.6544855"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882950"},{"key":"e_1_2_1_72_1","doi-asserted-by":"crossref","unstructured":"George M. Slota Sivasankaran Rajamanickam Karen Devine and Kamesh Madduri. 2017. Partitioning trillion-edge graphs in minutes. In IPDPS.  George M. Slota Sivasankaran Rajamanickam Karen Devine and Kamesh Madduri. 2017. Partitioning trillion-edge graphs in minutes. In IPDPS.","DOI":"10.1109\/IPDPS.2017.95"},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","unstructured":"Isabelle Stanton and Gabriel Kliot. 2012. Streaming graph partitioning for large distributed graphs. In KDD. 1222--1230.  Isabelle Stanton and Gabriel Kliot. 2012. Streaming graph partitioning for large distributed graphs. In KDD. 1222--1230.","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Leslie G. Valiant. 1990. General purpose parallel architectures. In Handbook of Theoretical Computer Science Vol A.  Leslie G. Valiant. 1990. General purpose parallel architectures. In Handbook of Theoretical Computer Science Vol A.","DOI":"10.1016\/B978-0-444-88071-0.50023-0"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2992784"},{"volume-title":"Sai Charan Koduru, and Rajiv Gupta","year":"2014","author":"Vora Keval","key":"e_1_2_1_78_1"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093315.3037747"},{"key":"e_1_2_1_80_1","unstructured":"Guozhang Wang Wenlei Xie Alan J. Demers and Johannes Gehrke. 2013. Asynchronous large-scale graph processing made easy. In CIDR.  Guozhang Wang Wenlei Xie Alan J. Demers and Johannes Gehrke. 2013. Asynchronous large-scale graph processing made easy. In CIDR."},{"volume-title":"Xing","year":"2015","author":"Wei Jinliang","key":"e_1_2_1_81_1"},{"volume-title":"Wright and Andreas Ziegler","year":"2015","author":"Marvin","key":"e_1_2_1_82_1"},{"key":"e_1_2_1_83_1","unstructured":"Chenning Xie Rong Chen Haibing Guan Binyu Zang and Haibo Chen. 2015. SYNC or ASYNC: Time to fuse for distributed graph-parallel computation. In PPOPP.  Chenning Xie Rong Chen Haibing Guan Binyu Zang and Haibo Chen. 2015. SYNC or ASYNC: Time to fuse for distributed graph-parallel computation. In PPOPP."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2015.2472014"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000056"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Da Yan James Cheng Yi Lu and Wilfred Ng. 2015. Effective techniques for message reduction and load balancing in distributed graph computation. In WWW. 1307--1317.  Da Yan James Cheng Yi Lu and Wilfred Ng. 2015. Effective techniques for message reduction and load balancing in distributed graph computation. In WWW. 1307--1317.","DOI":"10.1145\/2736277.2741096"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876477"},{"key":"e_1_2_1_89_1","unstructured":"Matei Zaharia Andy Konwinski Anthony D. Joseph Randy H. Katz and Ion Stoica. 2008. Improving mapreduce performance in heterogeneous environments. In OSDI.  Matei Zaharia Andy Konwinski Anthony D. Joseph Randy H. Katz and Ion Stoica. 2008. Improving mapreduce performance in heterogeneous environments. In OSDI."},{"key":"e_1_2_1_90_1","unstructured":"Timothy A. K. Zakian Ludovic Capelli and Zhenjiang Hu. 2018. Automatic Incrementalization of Vertex-Centric Programs. http:\/\/www.cs.ox.ac.uk\/people\/timothy.zakian\/icpp_draft.pdf.  Timothy A. K. Zakian Ludovic Capelli and Zhenjiang Hu. 2018. Automatic Incrementalization of Vertex-Centric Programs. http:\/\/www.cs.ox.ac.uk\/people\/timothy.zakian\/icpp_draft.pdf."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"volume-title":"Convergence of synchronous and asynchronous algorithms in multiclass networks","author":"Zhang Zhensheng","key":"e_1_2_1_92_1","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.1991.147605"},{"volume-title":"Gemini: A computation-centric distributed graph processing system. In OSDI. 301--316.","year":"2016","author":"Zhu Xiaowei","key":"e_1_2_1_93_1"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:33Z","timestamp":1750193253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,30]]},"references-count":91,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3397491"],"URL":"https:\/\/doi.org\/10.1145\/3397491","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2020,6,30]]},"assertion":[{"value":"2018-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}