by Skillo StaffA distributed lock coordinates access to a shared resource across multiple machines, so only one can use it at a time. This guide explains distributed locks.
by Skillo StaffTwo-phase commit is a protocol that helps multiple systems agree to either all commit a transaction or all abort it. This guide explains two-phase commit.
by Skillo StaffStrong consistency means that once data is written, every later read sees that latest value, so everyone shares one up-to-date view. This guide explains it.
by Skillo StaffFault tolerance is the ability of a system to keep operating properly even when some of its components fail. This guide explains what fault tolerance is.
by Skillo StaffThe CAP theorem says a distributed data store cannot simultaneously guarantee consistency, availability, and partition tolerance. This guide explains the CAP theorem.
by Skillo StaffA vector clock is a mechanism for determining the order of events in a distributed system, helping detect which events came before others. This guide explains it.
by Skillo StaffA quorum is the minimum number of participants that must agree for a distributed system to make a decision or operation valid. This guide explains quorums.
by Skillo StaffConsensus is the problem of getting multiple machines in a distributed system to agree on a single value, even despite failures. This guide explains consensus.
by Skillo StaffLeader election is the process by which machines in a distributed system choose one of them to act as the coordinator. This guide explains leader election.
by Skillo StaffEventual consistency is a model where copies of data across a distributed system become consistent over time, rather than instantly. This guide explains what it is.
by Skillo StaffPublish-subscribe is a messaging pattern where senders publish messages without knowing who will receive them, and subscribers receive only what they are interested in. This guide explains it.