Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$? (per node) words (Only needs to keep track of multiplicative correction $s$, its own clocks, and possibly O(1) other info) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM (per node) == Year == 2007 == Reference == https://www.researchgate.net/publication/224306349_Clock-Sampling_Mutual_Network_Synchronization_for_M...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$? (per node) words

(Only needs to keep track of multiplicative correction $s$, its own clocks, and possibly O(1) other info)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM (per node)

Year

2007

Reference

https://www.researchgate.net/publication/224306349_Clock-Sampling_Mutual_Network_Synchronization_for_Mobile_Multi-hop_Wireless_Ad_Hoc_Networks

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Clock-sampling_mutual_network_synchronization_(Clock_Synchronization_in_Distributed_Systems_Clock_Synchronization_in_Distributed_Systems)&oldid=44995"