{"id":"https://openalex.org/W2951846568","doi":"https://doi.org/10.1145/3323165.3323201","title":"Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers","display_name":"Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2951846568","doi":"https://doi.org/10.1145/3323165.3323201","mag":"2951846568"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323201","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2003.09363","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dan Alistarh","orcid":null},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Giorgi Nadiradze","orcid":null},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Giorgi Nadiradze","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":null,"display_name":"Nikita Koval","orcid":null},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nikita Koval","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":0.4087,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6479804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"154"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/scalability","display_name":"Scalability","score":0.6256999969482422},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.5881999731063843},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5697000026702881},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5267999768257141},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4221000075340271},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.3878999948501587},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.35740000009536743},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.34880000352859497},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3467000126838684}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7476999759674072},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6256999969482422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6067000031471252},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.5881999731063843},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5697000026702881},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41429999470710754},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3878999948501587},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.35740000009536743},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.34880000352859497},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3467000126838684},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.3443000018596649},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3228999972343445},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.30550000071525574},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2709999978542328},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.251800000667572},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3323165.3323201","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2003.09363","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.09363","pdf_url":"https://arxiv.org/pdf/2003.09363","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2003.09363","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.09363","pdf_url":"https://arxiv.org/pdf/2003.09363","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1438340602","https://openalex.org/W1441331420","https://openalex.org/W1968067819","https://openalex.org/W1970702766","https://openalex.org/W1981032891","https://openalex.org/W2012223233","https://openalex.org/W2016559894","https://openalex.org/W2032401773","https://openalex.org/W2034102265","https://openalex.org/W2057041531","https://openalex.org/W2057112598","https://openalex.org/W2061394399","https://openalex.org/W2071759604","https://openalex.org/W2087530649","https://openalex.org/W2132473764","https://openalex.org/W2151690061","https://openalex.org/W2169528473","https://openalex.org/W2327526361","https://openalex.org/W2469481711","https://openalex.org/W2625050767","https://openalex.org/W2736812013","https://openalex.org/W2739409954","https://openalex.org/W2802440256","https://openalex.org/W2886779068","https://openalex.org/W2963146589","https://openalex.org/W4256739278"],"related_works":[],"abstract_inverted_index":{"Several":[0],"classic":[1],"problems":[2],"in":[3,46,97,163],"graph":[4],"processing":[5],"and":[6,84,124,151,215],"computational":[7],"geometry":[8],"are":[9],"solved":[10],"via":[11,138],"incremental":[12,95,134],"algorithms,":[13],"which":[14,27,47],"split":[15],"computation":[16,96],"into":[17],"a":[18,40,53,131,157,173,262],"series":[19],"of":[20,35,78,133,161,165,176,179,188,234,243,265],"small":[21],"tasks":[22,49,189],"acting":[23],"on":[24],"shared":[25],"state,":[26],"gets":[28],"updated":[29],"progressively.":[30],"While":[31,90],"the":[32,48,73,126,166,186,198,209,218,232,240,244,248],"sequential":[33],"variant":[34],"such":[36,58,146,220],"algorithms":[37,59,135,145,258],"usually":[38],"specifies":[39],"fixed":[41],"(but":[42],"sometimes":[43],"random)":[44],"order":[45],"should":[50],"be":[51,191,237],"performed,":[52],"standard":[54],"approach":[55,110],"to":[56,61,65,190,269],"parallelizing":[57],"is":[60,72,101,185,201,208,217],"relax":[62],"this":[63,98,107,118,122,229],"constraint":[64],"allow":[66],"for":[67,75,85,144,273],"out-of-order":[68],"parallel":[69,76,86],"execution.":[70],"This":[71],"case":[74],"implementations":[77],"Dijkstra's":[79],"single-source":[80],"shortest-paths":[81],"(SSSP)":[82],"algorithm,":[83],"Delaunay":[87,148],"mesh":[88,149],"triangulation.":[89],"many":[91],"software":[92],"frameworks":[93],"parallelize":[94],"way,":[99],"it":[100],"still":[102,112],"not":[103],"well":[104],"understood":[105],"whether":[106],"relaxed":[108,139,245,276],"ordering":[109],"can":[111],"provide":[113,252],"any":[114],"complexity":[115],"guarantees.":[116],"In":[117,222],"paper,":[119],"we":[120,195,251],"address":[121],"problem,":[123],"analyze":[125],"efficiency":[127],"guarantees":[128],"provided":[129],"by":[130,153,239],"range":[132],"when":[136],"parallelized":[137],"schedulers.":[140,277],"We":[141],"show":[142,196],"that,":[143],"as":[147],"triangulation":[150],"sorting":[152],"insertion,":[154],"schedulers":[155],"with":[156],"maximum":[158,167,174,210],"relaxation":[159,235],"factor":[160],"k":[162],"terms":[164],"priority":[168],"inversion":[169],"allowed":[170],"will":[171,236,259],"introduce":[172],"amount":[175,264],"wasted":[177,266],"work":[178,200,267],"O(\u0142og":[180],"n":[181,184,226],"poly(k)),":[182],"where":[183,206,225],"number":[187],"executed.":[192],"For":[193],"SSSP,":[194],"that":[197,231,256],"additional":[199],"O(poly(k),":[202],"dmax":[203,207],"/":[204],"wmin),":[205],"distance":[211],"between":[212],"two":[213],"nodes,":[214],"wmin":[216],"minimum":[219],"distance.":[221],"practical":[223],"settings":[224],">>":[227],"k,":[228],"suggests":[230],"overheads":[233],"outweighed":[238],"improved":[241],"scalability":[242],"scheduler.":[246],"On":[247],"negative":[249],"side,":[250],"lower":[253],"bounds":[254],"showing":[255],"certain":[257],"inherently":[260],"incur":[261],"non-trivial":[263],"due":[268],"scheduler":[270],"relaxation,":[271],"even":[272],"relatively":[274],"benign":[275]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-06-27T00:00:00"}