License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2018.47
URN: urn:nbn:de:0030-drops-98360
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9836/
Go to the corresponding LIPIcs Volume Portal


Frank, Reginald ; Welch, Jennifer L.

Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids

pdf-format:
LIPIcs-DISC-2018-47.pdf (0.4 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{frank_et_al:LIPIcs:2018:9836,
  author =	{Reginald Frank and Jennifer L. Welch},
  title =	{{Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids}},
  booktitle =	{32nd International Symposium on Distributed Computing  (DISC 2018)},
  pages =	{47:1--47:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Ulrich Schmid and Josef Widder},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9836},
  URN =		{urn:nbn:de:0030-drops-98360},
  doi =		{10.4230/LIPIcs.DISC.2018.47},
  annote =	{Keywords: Clock synchronization, Lower bound, k-ary m-toroid}
}

Keywords: Clock synchronization, Lower bound, k-ary m-toroid
Collection: 32nd International Symposium on Distributed Computing (DISC 2018)
Issue Date: 2018
Date of publication: 04.10.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI