{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:46:16Z","timestamp":1765356376698,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"973 Program","award":["2014CB340302"],"award-info":[{"award-number":["2014CB340302"]}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["652976"],"award-info":[{"award-number":["652976"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61421003, 61602023"],"award-info":[{"award-number":["61421003, 61602023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M025268\/1"],"award-info":[{"award-number":["EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Advanced Innovation Center for Big Data and Brain Computing"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196918","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"1141-1156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Adaptive Asynchronous Parallelization of Graph Algorithms"],"prefix":"10.1145","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh &Beihang University, Edinburgh, United Kingdom"}]},{"given":"Ping","family":"Lu","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Xiaojian","family":"Luo","sequence":"additional","affiliation":[{"name":"7 Bridges Ltd., Beijing, China"}]},{"given":"Jingbo","family":"Xu","sequence":"additional","affiliation":[{"name":"Beihang University &7 Bridges Ltd., Beijing, China"}]},{"given":"Qiang","family":"Yin","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Beihang University &7 Bridges Ltd., Beijing, China"}]},{"given":"Ruiqi","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Friendster. https:\/\/snap.stanford.edu\/data\/com-Friendster.html.  Friendster. https:\/\/snap.stanford.edu\/data\/com-Friendster.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Giraph. http:\/\/giraph.apache.org\/.  Giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"GTgraph. http:\/\/www.cse.psu.edu\/~kxm85\/software\/GTgraph\/.  GTgraph. http:\/\/www.cse.psu.edu\/~kxm85\/software\/GTgraph\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Movielens. http:\/\/grouplens.org\/datasets\/movielens\/.  Movielens. http:\/\/grouplens.org\/datasets\/movielens\/."},{"key":"e_1_3_2_1_5_1","unstructured":"MPICH. https:\/\/www.mpich.org\/.  MPICH. https:\/\/www.mpich.org\/."},{"key":"e_1_3_2_1_6_1","unstructured":"Netflix prize data. https:\/\/www.kaggle.com\/netflix-inc\/netflix-prize-data.  Netflix prize data. https:\/\/www.kaggle.com\/netflix-inc\/netflix-prize-data."},{"key":"e_1_3_2_1_7_1","unstructured":"Traffic. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml.  Traffic. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml."},{"volume-title":"http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06--2007-05\/","year":"2006","key":"e_1_3_2_1_8_1","unstructured":"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\/, 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_3_2_1_12_1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2008","unstructured":"J. Bang-Jensen and G. Z. Gutin . Digraphs: Theory, Algorithms and Applications . Springer , 2008 . J. Bang-Jensen and G. Z. Gutin. Digraphs: Theory, Algorithms and Applications. Springer, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487984"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.10.007"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882954"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995162"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2887007.2887019"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370581"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035944"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137801"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_26_1","volume-title":"USENIX","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: Distributed graph-parallel computation on natural graphs . In USENIX , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed graph-parallel computation on natural graphs. In USENIX, 2012."},{"key":"e_1_3_2_1_27_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph processing in a distributed dataflow framework . In OSDI , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph processing in a distributed dataflow framework. In OSDI, 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_3_2_1_30_1","first-page":"1223","volume-title":"NIPS","author":"Ho Q.","year":"2013","unstructured":"Q. Ho , J. Cipar , H. Cui , S. Lee , J. K. Kim , P. B. Gibbons , G. A. Gibson , G. R. Ganger , and E. P. Xing . More effective distributed ML via a stale synchronous parallel parameter server . In NIPS , pages 1223 -- 1231 , 2013 . Q. Ho, J. Cipar, H. Cui, S. Lee, J. K. Kim, P. B. Gibbons, G. A. Gibson, G. R. Ganger, and E. P. Xing. More effective distributed ML via a stale synchronous parallel parameter server. In NIPS, pages 1223--1231, 2013."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.11.004"},{"key":"e_1_3_2_1_35_1","volume-title":"Theory and application of infinite series","author":"Knopp K.","year":"2013","unstructured":"K. Knopp . Theory and application of infinite series . Courier Corporation , 2013 . K. Knopp. Theory and application of infinite series. Courier Corporation, 2013."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685095"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_41_1","volume-title":"HotOS","author":"McSherry F.","year":"2015","unstructured":"F. McSherry , M. Isard , and D. G. Murray . Scalability! But at what cost ? In HotOS , 2015 . F. McSherry, M. Isard, and D. G. Murray. Scalability! But at what cost? In HotOS, 2015."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882950"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.95"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_49_1","volume-title":"Handbook of Theoretical Computer Science, Vol A.","author":"Valiant L. G.","year":"1990","unstructured":"L. G. Valiant . General purpose parallel architectures. In Handbook of Theoretical Computer Science, Vol A. 1990 . L. G. Valiant. General purpose parallel architectures. In Handbook of Theoretical Computer Science, Vol A. 1990."},{"key":"e_1_3_2_1_50_1","volume-title":"CIDR","author":"Wang G.","year":"2013","unstructured":"G. Wang , W. Xie , A. J. Demers , and J. Gehrke . Asynchronous large-scale graph processing made easy . In CIDR , 2013 . G. Wang, W. Xie, A. J. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In CIDR, 2013."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806778"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688508"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2015.2472014"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000056"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_2_1_56_1","volume-title":"OSDI","author":"Zaharia M.","year":"2008","unstructured":"M. Zaharia , A. Konwinski , A. D. Joseph , R. H. Katz , and I. Stoica . Improving mapreduce performance in heterogeneous environments . In OSDI , 2008 . M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica. Improving mapreduce performance in heterogeneous environments. In OSDI, 2008."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1991.147605"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston TX USA","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":57,"alternative-id":["10.1145\/3183713.3196918","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196918","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}