LIPIcs.DISC.2018.47.pdf
- Filesize: 361 kB
- 3 pages
Document
Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids
Authors
Reginald Frank 
,
-
Part of:
Volume:
32nd International Symposium on Distributed Computing (DISC 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-10-04
File
Document Identifiers
Author Details
Cite AsGet BibTex
Reginald Frank and Jennifer L. Welch. Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 47:1-47:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.DISC.2018.47
https://doi.org/10.4230/LIPIcs.DISC.2018.47
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
Keywords
- Clock synchronization
- Lower bound
- k-ary m-toroid
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Hagit Attiya, Amir Herzberg, and Sergio Rajsbaum. Optimal clock synchronization under different delay assumptions. SIAM J. Comput., 25(2):369-389, 1996.
-
Hagit Attiya and Jennifer L. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics, Second Edition. John Wiley &Sons, Hoboken, NJ, 2004.
-
Saad Biaz and Jennifer L. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Inf. Process. Lett., 80(3):151-157, 2001.
-
Joseph Y. Halpern, Nimrod Megiddo, and Ashfaq A. Munshi. Optimal precision in the presence of uncertainty. J. Complexity, 1(2):170-196, 1985.
-
Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Inform. Control, 62(2/3):190-204, 1984.
-
Boaz Patt-Shamir and Sergio Rajsbaum. A theory of clock synchronization (extended abstract). In Proc. 26th Annual ACM Symp. Theory of Comput., pages 810-819, 1994.