{"id":"https://openalex.org/W2798738742","doi":"https://doi.org/10.1145/3183713.3196918","title":"Adaptive Asynchronous Parallelization of Graph Algorithms","display_name":"Adaptive Asynchronous Parallelization of Graph Algorithms","publication_year":2018,"publication_date":"2018-05-25","ids":{"openalex":"https://openalex.org/W2798738742","doi":"https://doi.org/10.1145/3183713.3196918","mag":"2798738742"},"language":"en","primary_location":{"id":"doi:10.1145/3183713.3196918","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3196918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/a3b6b6b0-4210-4142-973f-6ac5851cd370","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070565287","display_name":"Wenfei Fan","orcid":"https://orcid.org/0000-0001-5149-2656"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["University of Edinburgh &Beihang University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh &Beihang University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013499387","display_name":"Ping L\u00fc","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ping Lu","raw_affiliation_strings":["Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060314803","display_name":"Xiaojian Luo","orcid":"https://orcid.org/0000-0002-3408-5394"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaojian Luo","raw_affiliation_strings":["7 Bridges Ltd., Beijing, China"],"affiliations":[{"raw_affiliation_string":"7 Bridges Ltd., Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001504785","display_name":"Jingbo Xu","orcid":"https://orcid.org/0000-0002-0110-2821"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingbo Xu","raw_affiliation_strings":["Beihang University &7 Bridges Ltd., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University &7 Bridges Ltd., Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035018298","display_name":"Qiang Yin","orcid":"https://orcid.org/0000-0003-3398-8345"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiang Yin","raw_affiliation_strings":["Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032456107","display_name":"Wenyuan Yu","orcid":"https://orcid.org/0000-0002-2917-5993"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenyuan Yu","raw_affiliation_strings":["Beihang University &7 Bridges Ltd., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University &7 Bridges Ltd., Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026266925","display_name":"Ruiqi Xu","orcid":"https://orcid.org/0009-0007-7269-9155"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ruiqi Xu","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":2.0892,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.90692917,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1141","last_page":"1156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8610817193984985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8504348993301392},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7532554268836975},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.684876024723053},{"id":"https://openalex.org/keywords/bulk-synchronous-parallel","display_name":"Bulk synchronous parallel","score":0.6759963035583496},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.6247966885566711},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5634140968322754},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5276241302490234},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3958432674407959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35931432247161865},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32857489585876465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08575093746185303}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8610817193984985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8504348993301392},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7532554268836975},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.684876024723053},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.6759963035583496},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.6247966885566711},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5634140968322754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5276241302490234},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3958432674407959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35931432247161865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32857489585876465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08575093746185303},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3183713.3196918","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3196918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/a3b6b6b0-4210-4142-973f-6ac5851cd370","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a3b6b6b0-4210-4142-973f-6ac5851cd370","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Lu, P, Luo, X, Xu, J, Yin, Q, Yu, W & Xu, R 2018, Adaptive Asynchronous Parallelization of Graph Algorithms. in Proceedings of the 2018 International Conference on Management of Data (SIGMOD'18). International Conference on Management of Data, Texas, USA, pp. 1141-1156, 2018 ACM SIGMOD/PODS International Conference on Management of Data, Houston, Texas, United States, 10/06/18. https://doi.org/10.1145/3183713.3196918","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/a3b6b6b0-4210-4142-973f-6ac5851cd370","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/adaptive-asynchronous-parallelization-of-graph-algorithms(a3b6b6b0-4210-4142-973f-6ac5851cd370).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/a3b6b6b0-4210-4142-973f-6ac5851cd370","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a3b6b6b0-4210-4142-973f-6ac5851cd370","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Lu, P, Luo, X, Xu, J, Yin, Q, Yu, W & Xu, R 2018, Adaptive Asynchronous Parallelization of Graph Algorithms. in Proceedings of the 2018 International Conference on Management of Data (SIGMOD'18). International Conference on Management of Data, Texas, USA, pp. 1141-1156, 2018 ACM SIGMOD/PODS International Conference on Management of Data, Houston, Texas, United States, 10/06/18. https://doi.org/10.1145/3183713.3196918","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1641974707","display_name":null,"funder_award_id":"652976","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G5402496802","display_name":null,"funder_award_id":"61421003, 61602023","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8298339663","display_name":"VADA: Value Added Data Systems -- Principles and Architecture","funder_award_id":"EP/M025268/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8400180575","display_name":null,"funder_award_id":"EP/M025268/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W134051198","https://openalex.org/W217817341","https://openalex.org/W1425731158","https://openalex.org/W1448681276","https://openalex.org/W1548164611","https://openalex.org/W1805871248","https://openalex.org/W1861377444","https://openalex.org/W1969805974","https://openalex.org/W1969970763","https://openalex.org/W2004053910","https://openalex.org/W2016559894","https://openalex.org/W2019380637","https://openalex.org/W2022490362","https://openalex.org/W2029706450","https://openalex.org/W2036120890","https://openalex.org/W2036631599","https://openalex.org/W2045271686","https://openalex.org/W2049354208","https://openalex.org/W2051586153","https://openalex.org/W2054141820","https://openalex.org/W2064635301","https://openalex.org/W2080098453","https://openalex.org/W2083842231","https://openalex.org/W2084224084","https://openalex.org/W2096544401","https://openalex.org/W2097284499","https://openalex.org/W2127653767","https://openalex.org/W2131053137","https://openalex.org/W2132737349","https://openalex.org/W2140181879","https://openalex.org/W2166326676","https://openalex.org/W2170616854","https://openalex.org/W2171329192","https://openalex.org/W2173213060","https://openalex.org/W2259576664","https://openalex.org/W2263157912","https://openalex.org/W2281494333","https://openalex.org/W2314329857","https://openalex.org/W2429966330","https://openalex.org/W2484611686","https://openalex.org/W2574229471","https://openalex.org/W2579247884","https://openalex.org/W2613088476","https://openalex.org/W2613159091","https://openalex.org/W2751226072","https://openalex.org/W2798579874","https://openalex.org/W2962885409","https://openalex.org/W2963804743","https://openalex.org/W2964281761","https://openalex.org/W6632352731","https://openalex.org/W6638322584"],"related_works":["https://openalex.org/W2263157912","https://openalex.org/W2054665744","https://openalex.org/W2099794578","https://openalex.org/W1913423701","https://openalex.org/W4294310378","https://openalex.org/W55423022","https://openalex.org/W2357113990","https://openalex.org/W1981558729","https://openalex.org/W2347452327","https://openalex.org/W2357914513"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"Adaptive":[4],"Asynchronous":[5,20],"Parallel":[6,17,21,46],"(AAP)":[7],"model":[8,47,77],"for":[9,142],"graph":[10,146],"computations.":[11,147],"As":[12],"opposed":[13],"to":[14,82,102],"Bulk":[15],"Synchronous":[16,45],"(BSP)":[18],"and":[19,28,43,93,125,129,140],"(AP)":[22],"models,":[23],"AAP":[24,56,80,100,117,136],"reduces":[25],"both":[26],"stragglers":[27],"stale":[29],"computations":[30],"by":[31,60],"dynamically":[32],"adjusting":[33],"relative":[34],"progress":[35],"of":[36,52,69,78,145],"workers.":[37],"We":[38],"show":[39,115],"that":[40,116,135],"BSP,":[41,123,138],"AP":[42,124,139],"Stale":[44],"(SSP)":[48],"are":[49,111],"special":[50],"cases":[51],"AAP.":[53],"Better":[54],"yet,":[55],"optimizes":[57],"parallel":[58],"processing":[59],"adaptively":[61],"switching":[62],"among":[63],"these":[64],"models":[65],"at":[66,104],"different":[67],"stages":[68],"a":[70,97,143],"single":[71],"execution.":[72],"Moreover,":[73],"employing":[74],"the":[75,108],"programming":[76],"GRAPE,":[79],"aims":[81],"parallelize":[83],"existing":[84],"sequential":[85,109],"algorithms":[86,110],"based":[87],"on":[88],"fixpoint":[89],"computation":[90],"with":[91],"partial":[92],"incremental":[94],"evaluation.":[95],"Under":[96],"monotone":[98],"condition,":[99],"guarantees":[101],"converge":[103],"correct":[105],"answers":[106],"if":[107],"correct.":[112],"Furthermore,":[113],"we":[114,132],"can":[118],"optimally":[119],"simulate":[120],"MapReduce,":[121],"PRAM,":[122],"SSP.":[126],"Using":[127],"real-life":[128],"synthetic":[130],"graphs,":[131],"experimentally":[133],"verify":[134],"outperforms":[137],"SSP":[141],"variety":[144]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}