- Algorithms
- >
- Concurrent algorithms
- >
- Distributed algorithms
- >
- Logical clock algorithms

- Applied mathematics
- >
- Algorithms
- >
- Distributed algorithms
- >
- Logical clock algorithms

- Mathematical logic
- >
- Algorithms
- >
- Distributed algorithms
- >
- Logical clock algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Distributed algorithms
- >
- Logical clock algorithms

Vector clock

A vector clock is a data structure used for determining the partial ordering of events in a distributed system and detecting causality violations. Just as in Lamport timestamps, inter-process messages

Logical clock

A logical clock is a mechanism for capturing chronological and causal relationships in a distributed system. Often, distributed systems may have no physically synchronous global clock. In many applica

Happened-before

In computer science, the happened-before relation (denoted: ) is a relation between the result of two events, such that if one event should happen before another event, the result must reflect that, e

Version vector

A version vector is a mechanism for tracking changes to data in a distributed system, where multiple agents might update the data at different times. The version vector allows the participants to dete

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. A matrix clock maintains

Lamport timestamp

The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfec

© 2023 Useful Links.