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

From Algorithm Wiki
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