{"id":"https://openalex.org/W4283397908","doi":"https://doi.org/10.1145/3502181.3531468","title":"Optimizing the Bruck Algorithm for Non-uniform All-to-all Communication","display_name":"Optimizing the Bruck Algorithm for Non-uniform All-to-all Communication","publication_year":2022,"publication_date":"2022-06-23","ids":{"openalex":"https://openalex.org/W4283397908","doi":"https://doi.org/10.1145/3502181.3531468"},"language":"en","primary_location":{"id":"doi:10.1145/3502181.3531468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3502181.3531468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086407525","display_name":"Ke Fan","orcid":"https://orcid.org/0000-0002-9563-6129"},"institutions":[{"id":"https://openalex.org/I32389192","display_name":"University of Alabama at Birmingham","ror":"https://ror.org/008s83205","country_code":"US","type":"education","lineage":["https://openalex.org/I32389192"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ke Fan","raw_affiliation_strings":["University of Alabama at Birmingham, Birmingham, AL, USA"],"affiliations":[{"raw_affiliation_string":"University of Alabama at Birmingham, Birmingham, AL, USA","institution_ids":["https://openalex.org/I32389192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080073613","display_name":"Thomas Gilray","orcid":"https://orcid.org/0000-0002-0393-8542"},"institutions":[{"id":"https://openalex.org/I32389192","display_name":"University of Alabama at Birmingham","ror":"https://ror.org/008s83205","country_code":"US","type":"education","lineage":["https://openalex.org/I32389192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Gilray","raw_affiliation_strings":["University of Alabama at Birmingham, Birmingham, AL, USA"],"affiliations":[{"raw_affiliation_string":"University of Alabama at Birmingham, Birmingham, AL, USA","institution_ids":["https://openalex.org/I32389192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009460413","display_name":"Valerio Pascucci","orcid":"https://orcid.org/0000-0002-8877-2042"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Valerio Pascucci","raw_affiliation_strings":["University of Utah, Salt Lake City, UT, USA"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082317159","display_name":"Xuan Huang","orcid":"https://orcid.org/0000-0002-5510-3467"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuan Huang","raw_affiliation_strings":["University of Utah, Salt Lake City, UT, USA"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066289382","display_name":"Kristopher Micinski","orcid":"https://orcid.org/0000-0002-8650-0991"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kristopher Micinski","raw_affiliation_strings":["Syracuse University, Syracuse, NY, USA"],"affiliations":[{"raw_affiliation_string":"Syracuse University, Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101815397","display_name":"Sidharth Kumar","orcid":"https://orcid.org/0009-0007-0418-9962"},"institutions":[{"id":"https://openalex.org/I32389192","display_name":"University of Alabama at Birmingham","ror":"https://ror.org/008s83205","country_code":"US","type":"education","lineage":["https://openalex.org/I32389192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sidharth Kumar","raw_affiliation_strings":["University of Alabama at Birmingham, Birmingham, AL, USA"],"affiliations":[{"raw_affiliation_string":"University of Alabama at Birmingham, Birmingham, AL, USA","institution_ids":["https://openalex.org/I32389192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5086407525"],"corresponding_institution_ids":["https://openalex.org/I32389192"],"apc_list":null,"apc_paid":null,"fwci":4.644,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9572696,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9993000030517578,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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.848940908908844},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6179855465888977},{"id":"https://openalex.org/keywords/message-passing-interface","display_name":"Message Passing Interface","score":0.5931681394577026},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5861608386039734},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5621508955955505},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5396137237548828},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5336008667945862},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4782409071922302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46354836225509644},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.40354782342910767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32297271490097046},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12040245532989502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09230834245681763},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08911502361297607}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.848940908908844},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6179855465888977},{"id":"https://openalex.org/C166782233","wikidata":"https://www.wikidata.org/wiki/Q127879","display_name":"Message Passing Interface","level":3,"score":0.5931681394577026},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5861608386039734},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5621508955955505},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5396137237548828},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5336008667945862},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4782409071922302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46354836225509644},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.40354782342910767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32297271490097046},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12040245532989502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09230834245681763},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08911502361297607},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3502181.3531468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3502181.3531468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1510543252","https://openalex.org/W1531516256","https://openalex.org/W1540417193","https://openalex.org/W1552387776","https://openalex.org/W1670978437","https://openalex.org/W1825216778","https://openalex.org/W1860827079","https://openalex.org/W1973120448","https://openalex.org/W2017915001","https://openalex.org/W2032484463","https://openalex.org/W2035080386","https://openalex.org/W2064683578","https://openalex.org/W2073074467","https://openalex.org/W2076167255","https://openalex.org/W2099507400","https://openalex.org/W2129418947","https://openalex.org/W2131613942","https://openalex.org/W2133557963","https://openalex.org/W2164131708","https://openalex.org/W2164303766","https://openalex.org/W2164945803","https://openalex.org/W2300823947","https://openalex.org/W2585196727","https://openalex.org/W2622559577","https://openalex.org/W2731415668","https://openalex.org/W3020934128","https://openalex.org/W3104967067","https://openalex.org/W3176675578","https://openalex.org/W4200526932"],"related_works":["https://openalex.org/W4386915331","https://openalex.org/W2124048060","https://openalex.org/W2378910916","https://openalex.org/W1511717675","https://openalex.org/W2361929291","https://openalex.org/W2116006827","https://openalex.org/W2086666199","https://openalex.org/W2185992486","https://openalex.org/W2110637160","https://openalex.org/W3005546554"],"abstract_inverted_index":{"In":[0],"MPI,":[1,34],"collective":[2],"routines":[3],"MPI_Alltoall":[4,41],"and":[5,38,52,99],"MPI_Alltoallv":[6,17,88],"play":[7],"an":[8],"important":[9],"role":[10],"in":[11,61],"facilitating":[12],"all-to-all":[13],"inter-process":[14],"data":[15,84,116],"exchange.":[16],"is":[18,77,89],"a":[19,43,58,71],"generalization":[20],"of":[21,26,29,33,45,95],"MPI_Alltoall,":[22],"supporting":[23],"the":[24,49,53,83,96,104,108],"exchange":[25],"non-uniform":[27],"distributions":[28],"data.":[30],"Popular":[31],"implementations":[32],"such":[35,47],"as":[36,48],"MPICH":[37],"OpenMPI,":[39],"implement":[40],"using":[42,92],"combination":[44],"techniques":[46,76],"Spread-out":[50,56],"algorithm":[51,111],"Bruck":[54,110],"algorithm.":[55],"has":[57],"linear":[59],"complexity":[60,67],"P,":[62],"compared":[63],"to":[64],"Bruck's":[65],"logarithmic":[66],"(P:":[68],"process":[69],"count);":[70],"selection":[72],"between":[73],"these":[74],"two":[75],"made":[78],"at":[79],"runtime":[80],"based":[81],"on":[82,103],"block":[85],"size.":[86],"However,":[87],"typically":[90],"implemented":[91],"only":[93],"variants":[94],"spread-out":[97],"algorithm,":[98],"therefore":[100],"misses":[101],"out":[102],"performance":[105],"benefits":[106],"that":[107],"log-time":[109],"offers":[112],"(especially":[113],"for":[114],"smaller":[115],"loads).":[117]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-22T08:09:32.410652","created_date":"2025-10-10T00:00:00"}