Matrix clock

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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 other hosts know, and is useful in applications such as checkpointing and garbage collection.

References[edit]

  1. ^ Drummond, Lúcia M. A.; Barbosa, Valmir C. (2003). "On reducing the complexity of matrix clocks". Parallel Computing. 29 (7): 895–905. doi:10.1016/S0167-8191(03)00066-8.