{"id":"https://openalex.org/W4380874660","doi":"https://doi.org/10.1145/3583668.3594598","title":"A Near-Optimal Deterministic Distributed Synchronizer","display_name":"A Near-Optimal Deterministic Distributed Synchronizer","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380874660","doi":"https://doi.org/10.1145/3583668.3594598"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594598","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594598","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594598","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594598","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063743357","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0003-4213-9898"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4213-9898","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092181841","display_name":"Anton Trygub","orcid":"https://orcid.org/0000-0001-6020-8469"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anton Trygub","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6020-8469","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063743357"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.1968,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48122648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/synchronizer","display_name":"Synchronizer","score":0.9769684672355652},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7673327922821045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7271156907081604},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6794726252555847},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.6728344559669495},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5255771279335022},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48253366351127625},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47906503081321716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43542250990867615},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41835296154022217},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3855947256088257},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3726809024810791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25832289457321167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22817766666412354},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1382673680782318}],"concepts":[{"id":"https://openalex.org/C66727535","wikidata":"https://www.wikidata.org/wiki/Q7662199","display_name":"Synchronizer","level":2,"score":0.9769684672355652},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7673327922821045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7271156907081604},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6794726252555847},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.6728344559669495},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5255771279335022},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48253366351127625},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47906503081321716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43542250990867615},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41835296154022217},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3855947256088257},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3726809024810791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25832289457321167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22817766666412354},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1382673680782318},{"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/3583668.3594598","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594598","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594598","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583668.3594598","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594598","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594598","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380874660.pdf","grobid_xml":"https://content.openalex.org/works/W4380874660.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1998544343","https://openalex.org/W2054910423","https://openalex.org/W2092534058","https://openalex.org/W2147599477","https://openalex.org/W2737872496","https://openalex.org/W2963662927","https://openalex.org/W3034790637"],"related_works":["https://openalex.org/W4376311906","https://openalex.org/W4380874660","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2950943763","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2798294881","https://openalex.org/W2565109825"],"abstract_inverted_index":{"We":[0,133],"provide":[1],"the":[2,31,41,43,53,78,85,93],"first":[3],"deterministic":[4,91],"distributed":[5,18,47],"synchronizer":[6,44,89,110],"with":[7,57,111],"near-optimal":[8,112],"time":[9,23,58],"complexity":[10,13,24,28,59,66],"and":[11,26,64,75,82,123,127,129,137],"message":[12,27,65],"overheads.":[14],"Concretely,":[15],"given":[16],"any":[17],"algorithm":[19,48,97,104],"A":[20,98],"that":[21,50,95],"has":[22],"T":[25,60],"M":[29],"in":[30,39,52,84,92,141],"synchronous":[32],"message-passing":[33,55],"model":[34,56],"(subject":[35],"to":[36],"some":[37,139],"care":[38],"defining":[40],"model),":[42],"provides":[45],"a":[46,108],"A\u2032":[49],"runs":[51],"asynchronous":[54],"\u00b7":[61,70],"poly(log":[62,71],"n)":[63],"(M":[67],"+":[68],"m)":[69],"n).":[72],"Here,":[73],"n":[74],"m":[76],"denote":[77],"number":[79],"of":[80,119],"nodes":[81],"edges":[83],"network,":[86],"respectively.":[87],"The":[88],"is":[90,99,103],"sense":[94],"if":[96],"deterministic,":[100],"then":[101],"so":[102],"A\u2032.":[105],"Previously,":[106],"only":[107],"randomized":[109],"overheads":[113],"was":[114],"known":[115],"by":[116],"seminal":[117],"results":[118],"Awerbuch,":[120],"Patt-Shamir,":[121],"Peleg,":[122],"Saks":[124],"[STOC":[125],"1992]":[126],"Awerbuch":[128],"Peleg":[130],"[FOCS":[131],"1990].":[132],"also":[134],"point":[135],"out":[136],"fix":[138],"inaccuracies":[140],"these":[142],"prior":[143],"works.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}