{"id":"https://openalex.org/W4286503967","doi":"https://doi.org/10.1145/3519270.3538450","title":"Massively Parallel Computation in a Heterogeneous Regime","display_name":"Massively Parallel Computation in a Heterogeneous Regime","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286503967","doi":"https://doi.org/10.1145/3519270.3538450"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538450","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of 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/A5023036907","display_name":"Orr Fischer","orcid":"https://orcid.org/0009-0007-4197-015X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Orr Fischer","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037120562","display_name":"Adi Horowitz","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Adi Horowitz","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Rotem Oshman","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.4567,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6564699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"345","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/sublinear-function","display_name":"Sublinear function","score":0.9668676853179932},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5703156590461731},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5469697713851929},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.5193644165992737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49651461839675903},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4569022059440613},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4482177495956421},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4417560398578644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4380892515182495},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43370741605758667},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39456838369369507},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38615405559539795},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33993053436279297}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9668676853179932},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5703156590461731},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5469697713851929},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.5193644165992737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49651461839675903},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4569022059440613},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4482177495956421},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4417560398578644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4380892515182495},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43370741605758667},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39456838369369507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38615405559539795},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33993053436279297},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538450","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3803866211","display_name":null,"funder_award_id":"2801/20","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2011843642","https://openalex.org/W2017588197","https://openalex.org/W2039307015","https://openalex.org/W2051586153","https://openalex.org/W2061099285","https://openalex.org/W2095293504","https://openalex.org/W2117526408","https://openalex.org/W2131681506","https://openalex.org/W2132202037","https://openalex.org/W2158343516","https://openalex.org/W2161455936","https://openalex.org/W2173213060","https://openalex.org/W2176844533","https://openalex.org/W2416738288","https://openalex.org/W2602671714","https://openalex.org/W2963264680","https://openalex.org/W2964294252","https://openalex.org/W2982458049","https://openalex.org/W4301441647","https://openalex.org/W6687322159","https://openalex.org/W6724612407"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2052708136","https://openalex.org/W2809723425","https://openalex.org/W2005302727","https://openalex.org/W4289097813","https://openalex.org/W3082028334","https://openalex.org/W1973725449","https://openalex.org/W3006511474"],"abstract_inverted_index":{"Massively-parallel":[0],"graph":[1,159],"algorithms":[2,155],"have":[3,212],"received":[4],"extensive":[5],"attention":[6],"over":[7],"the":[8,18,21,25,32,54,57,66,77,94,99,150,168,186,202,206,217],"past":[9],"decade,":[10],"with":[11,104,190],"research":[12],"focusing":[13],"on":[14,65],"three":[15],"memory":[16,55],"regimes:":[17],"superlinear":[19,213],"regime,":[20,23,80],"near-linear":[22,74,153,193,203],"and":[24,81,107,135,176],"sublinear":[26,29,78,100,169],"regime.":[27,204],"The":[28],"regime":[30,170],"is":[31,209],"most":[33,92],"desirable":[34],"in":[35,60,118,132,142,167,185,201,223],"practice,":[36],"but":[37],"conditional":[38,95],"hardness":[39,96],"results":[40,97],"point":[41],"towards":[42],"its":[43],"limitations.":[44],"In":[45],"this":[46],"work":[47,184],"we":[48,110],"study":[49],"a":[50,72,85,137,191],"heterogeneous":[51,67,187],"model,":[52],"where":[53],"of":[56,93,128,216],"machines":[58],"varies":[59],"size.":[61],"We":[62,146],"focus":[63],"mostly":[64],"setting":[68],"created":[69],"by":[70],"adding":[71],"single":[73,86,192],"machine":[75,88,208],"to":[76,90,164,183,211],"MPC":[79,154,188],"show":[82],"that":[83,116,124,140,149],"even":[84],"large":[87,207],"suffices":[89],"circumvent":[91],"for":[98,102,156],"regime:":[101],"graphs":[103],"n":[105],"vertices":[106],"m":[108],"edges,":[109],"give":[111],"(a)":[112],"an":[113,122,126],"MST":[114],"algorithm":[115,123,139],"runs":[117,141],"O(\u0142og\u0142og(m/n))":[119],"rounds;":[120,134],"(b)":[121],"constructs":[125],"O(k)-spanner":[127],"size":[129],"O(n^1+1/k":[130],")":[131],"O(1)":[133,224],"(c)":[136],"maximal-matching":[138],"O(\u221a\u0142og(m/n)":[143],"\u0142og\u0142og(m/n))":[144],"rounds.":[145,225],"also":[147],"observe":[148],"best":[151],"known":[152],"several":[157],"other":[158],"problems":[160,218],"which":[161],"are":[162],"conjectured":[163],"be":[165,181,221],"hard":[166],"(minimum":[171],"cut,":[172],"maximal":[173],"independent":[174],"set,":[175],"vertex":[177],"coloring)":[178],"can":[179,220],"easily":[180],"transformed":[182],"model":[189],"machine,":[194],"while":[195],"retaining":[196],"their":[197],"original":[198],"round":[199],"complexity":[200],"If":[205],"allowed":[210],"memory,":[214],"all":[215],"above":[219],"solved":[222]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}