imported>Citation bot: Add: s2cid. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 130/134

2023-03-27T21:15:02Z

Add: s2cid. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 130/134

New page

A '''matrix clock''' is a mechanism for capturing chronological and causal relationships in a [[distributed system]].

Matrix clocks are a generalization of the notion of [[vector clock]]s.<ref name="ParallelDrummond">{{cite journal
|last1=Drummond | first1=Lúcia M. A.
|last2=Barbosa | first2=Valmir C.
|year=2003
|title=On reducing the complexity of matrix clocks
|journal=Parallel Computing
|volume=29
|issue=7
|pages=895–905
|doi=10.1016/S0167-8191(03)00066-8|arxiv=cs/0309042| s2cid=269009
}}</ref> A matrix clock maintains a [[vector (data structure)|vector]] of the vector clocks for each communicating host.

Every time a message is exchanged, the sending host sends not only what it knows about the global state of [[time]], but also the state of time that it received from other hosts.

This allows establishing a lower bound on what other hosts know, and is useful in applications such as [[checkpointing]] and [[Garbage collection (computer science)|garbage collection]].

==References==
{{reflist}}

==See also==
* [[Lamport timestamps]]
* [[Vector clock]]
* [[Version vector]]

{{comp-sci-stub}}

[[Category:Logical clock algorithms]]

Matrix clock - Revision history

imported>Citation bot: Add: s2cid. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 130/134