MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$? (per node) words (Each node needs to keep track of O(1) information about itself, and O(1) information per neighbor for synchronization purposes) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM (per node) == Year == 2004 == Reference == https://ieeexplore.ieee.org/document/4359404")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$? (per node) words

(Each node needs to keep track of O(1) information about itself, and O(1) information per neighbor for synchronization purposes)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM (per node)

Year

2004

Reference

https://ieeexplore.ieee.org/document/4359404

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