{"id":"https://openalex.org/W3184165693","doi":"https://doi.org/10.1145/3460122","title":"All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns","display_name":"All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns","publication_year":2021,"publication_date":"2021-07-17","ids":{"openalex":"https://openalex.org/W3184165693","doi":"https://doi.org/10.1145/3460122","mag":"3184165693"},"language":"en","primary_location":{"id":"doi:10.1145/3460122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460122","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3460122","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060244583","display_name":"Jerzy Proficz","orcid":"https://orcid.org/0000-0003-2975-9339"},"institutions":[{"id":"https://openalex.org/I169333911","display_name":"Gda\u0144sk University of Technology","ror":"https://ror.org/006x4sc24","country_code":"PL","type":"education","lineage":["https://openalex.org/I169333911"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jerzy Proficz","raw_affiliation_strings":["Gdansk University of Technology, Centre of Informatics\u2014Tricity Academic Supercomputer & networK (CI TASK), Poland"],"affiliations":[{"raw_affiliation_string":"Gdansk University of Technology, Centre of Informatics\u2014Tricity Academic Supercomputer & networK (CI TASK), Poland","institution_ids":["https://openalex.org/I169333911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060244583"],"corresponding_institution_ids":["https://openalex.org/I169333911"],"apc_list":null,"apc_paid":null,"fwci":0.1528,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49523967,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994000196456909,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.8752568364143372},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6779391169548035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.657982349395752},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6516859531402588},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.618085503578186},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5145394206047058},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4992401599884033},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4926519989967346},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48990410566329956},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.46788114309310913}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8752568364143372},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6779391169548035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.657982349395752},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6516859531402588},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.618085503578186},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5145394206047058},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4992401599884033},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4926519989967346},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48990410566329956},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.46788114309310913},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3460122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460122","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3460122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460122","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3184165693.pdf","grobid_xml":"https://content.openalex.org/works/W3184165693.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1483165234","https://openalex.org/W1980008253","https://openalex.org/W2037492572","https://openalex.org/W2059124748","https://openalex.org/W2131613942","https://openalex.org/W2138979581","https://openalex.org/W2143300065","https://openalex.org/W2336076884","https://openalex.org/W2411600631","https://openalex.org/W2563570622","https://openalex.org/W2621496142","https://openalex.org/W2796744007","https://openalex.org/W2942929621","https://openalex.org/W2981114289","https://openalex.org/W3000073406","https://openalex.org/W3014015408","https://openalex.org/W3084075991","https://openalex.org/W3100098524","https://openalex.org/W3104089758","https://openalex.org/W3104149085","https://openalex.org/W3152157423"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2610007503"],"abstract_inverted_index":{"Two":[0],"novel":[1],"algorithms":[2,117],"for":[3,42,163],"the":[4,26,51,69,98,106,116,158,172,188],"all-gather":[5,53,173],"operation":[6],"resilient":[7],"to":[8,49,91,148,180],"imbalanced":[9,99],"process":[10,154],"arrival":[11],"patterns":[12],"(PATs)":[13],"are":[14,145],"presented.":[15,124],"The":[16,55,95,125,142],"first":[17],"one,":[18],"Background":[19,58,77],"Disseminated":[20],"Ring":[21],"(BDR),":[22],"is":[23,66,102,123,166],"based":[24,118],"on":[25,119],"regular":[27,86],"parallel":[28],"ring":[29],"algorithm":[30],"often":[31],"supplied":[32],"in":[33,132,176,185],"MPI":[34],"implementations":[35],"and":[36,109,153,168],"exploits":[37],"an":[38],"auxiliary":[39],"background":[40,96],"thread":[41],"early":[43],"data":[44,90,151],"exchange":[45],"from":[46],"faster":[47],"processes":[48],"accelerate":[50],"performed":[52,128],"operation.":[54],"other":[56],"algorithm,":[57,74],"Sorted":[59,78],"Linear":[60,79],"synchronized":[61],"tree":[62,81],"with":[63,105,138,187],"Broadcast":[64],"(BSLB),":[65],"built":[67],"upon":[68],"already":[70],"existing":[71],"PAP-aware":[72],"gather":[73],"that":[75,157],"is,":[76],"Synchronized":[80],"(BSLS),":[82],"followed":[83],"by":[84],"a":[85,120,133],"broadcast":[87],"distributing":[88],"gathered":[89],"all":[92],"participating":[93],"processes.":[94],"of":[97,115],"PAP":[100,107],"subject":[101],"described,":[103],"along":[104],"monitoring":[108],"evaluation":[110,114],"topics.":[111],"An":[112],"experimental":[113],"proposed":[121,159],"mini-benchmark":[122,126],"was":[127],"over":[129],"2,000":[130],"times":[131],"typical":[134],"HPC":[135],"cluster":[136],"architecture":[137],"homogeneous":[139],"compute":[140],"nodes.":[141],"obtained":[143],"results":[144],"analyzed":[146],"according":[147],"different":[149],"PATs,":[150],"sizes,":[152],"numbers,":[155],"showing":[156],"optimization":[160],"works":[161],"well":[162],"various":[164],"configurations,":[165],"scalable,":[167],"can":[169],"significantly":[170],"reduce":[171],"elapsed":[174],"times,":[175],"our":[177],"case,":[178],"up":[179],"factor":[181],"1.9":[182],"or":[183],"47%":[184],"comparison":[186],"best":[189],"state-of-the-art":[190],"solution.":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}