Tagged articles
consensus algorithms
19 articles · Page 1 of 1
This tutorial explains the definitions of faults and failures in distributed systems, explores their types and root causes, and presents fault‑tolerance mechanisms such as replication, checkpointing, redundancy, error detection, load balancing, and consensus algorithms to build resilient architectures.
consensus algorithmsdata replicationdistributed systems
0 likes · 10 min read

This article explains the principles, roles, phases, and typical application scenarios of four major distributed consensus algorithms—Paxos, Raft, ZAB, and Gossip—while also offering promotional material for extensive architecture and interview resources.
GossipPaxosRaft
0 likes · 7 min read

This article explains consistency in distributed systems, distinguishing strong and eventual consistency, outlines the CAP and FLP impossibility theorems, and details common consensus mechanisms such as two‑phase commit, three‑phase commit, and the Paxos algorithm.
2PC3PCConsistency
0 likes · 9 min read


ITPUBMar 14, 2023 · Fundamentals
This comprehensive guide explores core distributed system concepts—including the CAP theorem and its trade‑offs, BASE consistency, various distributed lock strategies, multiple transaction patterns such as 2PC, 3PC, TCC and Seata, as well as consensus algorithms Paxos and Raft, while also covering idempotency and rate‑limiting techniques.
CAP theoremIdempotencyconsensus algorithms
0 likes · 29 min read

This article explains the core principles and a range of consistency protocols—including CAP, ACID, BASE, 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease—detailing their roles, mechanisms, trade‑offs, and typical use cases in distributed systems.
2PCCAPConsistency
0 likes · 14 min read

This article explains the evolution from centralized to distributed architectures, the role of Zookeeper in solving consistency problems, the mechanics and drawbacks of 2‑phase and 3‑phase commits, and key consensus algorithms such as Paxos, Raft, ZAB, as well as CAP and BASE theories that guide practical system design.
2PC3PCBASE theory
0 likes · 23 min read

This article traces the evolution of database systems—from the first network and hierarchical models through relational databases, NoSQL sharding, and finally modern distributed SQL—explaining why distributed databases emerged, how they handle data distribution, consistency, SQL-to‑KV mapping, and transaction challenges.
NewSQLSQL to KVSharding
0 likes · 16 min read

This article provides a detailed summary of database concepts including data models (relational, document, graph), storage engine architectures (page‑oriented B‑tree, log‑structured LSM), transaction mechanisms, isolation levels, distributed transaction protocols, partitioning strategies, indexing, consistency models, and consensus algorithms such as Lamport timestamps and Raft.
ConsistencyData ModelsStorage Engines
0 likes · 29 min read

This article explains the core principles of distributed consistency, covering CAP, ACID, BASE, and detailed walkthroughs of 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease mechanisms, highlighting their trade‑offs, failure scenarios, and practical usage in modern systems.
CAP theoremConsistencyPaxos
0 likes · 26 min read

This article explains the fundamentals of distributed system consistency, covering weak and strong consistency, the CAP theorem, ACID vs BASE, and detailed overviews of protocols such as 2PC, 3PC, Paxos, Raft, Gossip, NWR, Quorum, and Lease mechanisms.
2PCConsistencyRaft
0 likes · 15 min read

This article explains why distributed theory and algorithms are crucial for architects, outlines the four foundational theories and eight key protocols, discusses their four evaluation dimensions, and provides a step‑by‑step learning roadmap illustrated with stories and practical examples.
CAP theoremConsistencyLearning Roadmap
0 likes · 10 min read

This article explains the Byzantine Generals Problem, maps its concepts to distributed consensus, distinguishes consensus from consistency, outlines oral‑message and signed‑message solutions, and analyzes their applicability and limitations in fault‑tolerant distributed systems.
Byzantine GeneralsDistributed Consensusconsensus algorithms
0 likes · 21 min read

This article compares Zookeeper and etcd, detailing their origins, architecture, APIs, strengths, and weaknesses, to help you decide which distributed coordination system best matches your project's requirements and programming language preferences.
RaftZABZooKeeper
0 likes · 8 min read


21CTOOct 11, 2019 · Fundamentals
This article walks through the evolution of distributed architectures, detailing single‑node, tiered services, caching, clustering, read/write splitting, CAP and BASE theories, Paxos consensus, and Zookeeper's ZAB protocol, providing a comprehensive guide for building resilient large‑scale systems.
CAP theoremPaxosZooKeeper
0 likes · 17 min read

This article explains distributed data consistency concepts, the CAP theorem, various consistency levels, and provides detailed overviews of three major consensus algorithms—Paxos, ZAB, and Raft—including their mechanisms, roles, and practical applications such as in CB‑SQL.
PaxosRaftZAB
0 likes · 18 min read

This article explains the fundamentals of distributed consistency protocols, covering Lamport's logical clocks, the basics and multi‑instance extensions of Paxos, Zookeeper's ZAB algorithm, and the Raft protocol, while comparing their designs, strengths, and practical engineering considerations.
PaxosRaftZAB
0 likes · 25 min read

This article explains the fundamentals of distributed consistency, introduces key terminology, and provides an in‑depth look at Raft's leader election, term handling, log replication, failure scenarios, and comparisons with Paxos, ZAB, PacificA, and Viewstamped Replication.
Leader ElectionRaftconsensus algorithms
0 likes · 16 min read


21CTOJan 16, 2018 · Fundamentals
Distributed systems rely on consensus to ensure consistent results, but achieving it faces fundamental challenges such as network unreliability, node failures, and trade‑offs captured by the CAP theorem, FLP impossibility, and various algorithms like Paxos, Raft, and Byzantine Fault Tolerance, each balancing consistency, availability, and safety.
Byzantine Fault ToleranceCAP theoremPaxos
0 likes · 26 min read

This article explains the core challenges of achieving consistency in distributed systems, describes consensus algorithms such as Paxos and Raft, discusses theoretical limits like the FLP impossibility and CAP theorem, and shows how trade‑offs among consistency, availability, and partition tolerance shape practical system design.
BlockchainCAP theoremConsistency
0 likes · 24 min read
