# Architecture principles whose category is Causality / Ordering / Distributed Time

> 14 records

This index as JSON: https://banes-lab.com/json/api/facets/architecture/category/causality-ordering-distributed-time

## Entries

- [Causality](https://banes-lab.com/records/architecture/causality.md): A design rule that every effect records the event that caused it, so its order can be reasoned about.
- [Causal Consistency](https://banes-lab.com/records/architecture/causal-consistency.md): A conceptual representation of a consistency guarantee in which no reader sees an effect before its cause.
- [Happens-Before Relationship](https://banes-lab.com/records/architecture/happens-before-relationship.md): A conceptual representation of the partial order in which one operation is known to precede another.
- [Event Ordering](https://banes-lab.com/records/architecture/event-ordering.md): A rule or precondition that a stateful consumer processes the events of one key in their sequence order.
- [Causal Dependency](https://banes-lab.com/records/architecture/causal-dependency.md): A conceptual representation of one step or event that cannot proceed until another has happened.
- [Dependency Graph](https://banes-lab.com/records/architecture/dependency-graph.md): Descriptive data about which modules, tasks or services depend on which, extracted as a directed graph.
- [Directed Acyclic Graph (DAG)](https://banes-lab.com/records/architecture/directed-acyclic-graph.md): A rule or precondition that every dependency points one way and the graph they form has no cycle, so its nodes can be put in topological order.
- [Vector Clocks](https://banes-lab.com/records/architecture/vector-clocks.md): A mechanism that keeps one counter per node on each update, so two updates can be compared as ordered or concurrent.
- [Lamport Clocks](https://banes-lab.com/records/architecture/lamport-clocks.md): A mechanism that stamps each event with a logical counter, advanced on every send and receive, to give a partial order.
- [Hybrid Logical Clocks](https://banes-lab.com/records/architecture/hybrid-logical-clocks.md): A mechanism that combines physical time with a logical counter, so timestamps follow causal order and stay close to wall-clock time.
- [CRDTs](https://banes-lab.com/records/architecture/crdts.md): A mechanism that stores replicated state in data types whose merge is commutative, so replicas converge without coordination.
- [Total-Order Broadcast](https://banes-lab.com/records/architecture/total-order-broadcast.md): A mechanism that delivers every message to every node in the same order, agreed by consensus.
- [CAP Theorem](https://banes-lab.com/records/architecture/cap-theorem.md): A conceptual representation of the choice a distributed store makes during a network partition, between consistency and availability.
- [PACELC Theorem](https://banes-lab.com/records/architecture/pacelc-theorem.md): A conceptual representation that extends the CAP theorem with the trade-off a healthy network still forces, between latency and consistency.