2026-10-03T01:56:16Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9836 2024-03-06T09:45:02Z ddc:004 open_access

Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids Frank, Reginald Welch, Jennifer L. Clock synchronization Lower bound k-ary m-toroid In this paper we show a tight closed-form expression for the optimal clock synchronization in k-ary m-cubes with wraparound, where k is odd. This is done by proving a lower bound of 1/4um (k-1/k), where k is the (odd) number of processes in each of the m dimensions, and u is the uncertainty in delay on every link. Our lower bound matches the previously known upper bound. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Reginald Frank and Jennifer L. Welch 2018 Is Part Of LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2018.47 urn:nbn:de:0030-drops-98360 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.47 eng https://creativecommons.org/licenses/by/3.0/legalcode