Matrix clock
 |
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 clocks.[1] A matrix clock maintains a 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 another hosts know, and is useful in applications such as checkpointing and garbage collection.
References
- ^
Drummond, Lúcia M. A. (July 2003). "On reducing the complexity of matrix clocks". Parallel Computing. 29 (7). Amsterdam, The Netherlands: Elsevier Science Publishers B. V.: pp 895-905. ISSN 0167-8191. Retrieved 2009-02-08.
{{cite journal}}:|pages=has extra text (help); Unknown parameter|coauthors=ignored (|author=suggested) (help)
 | This software article is a stub. You can help Wikipedia by expanding it. |