This article explains the Paxos consensus algorithm, detailing its roles (proposer, acceptor, learner), the two-phase prepare and accept process, handling of proposal numbers, and how it ensures strong consistency across distributed nodes through examples and diagrams.
This article explains the Raft consensus algorithm's leader election, log replication, and log alignment processes using a three‑node cluster example, detailing heartbeat timeouts, RequestVote handling, AppendEntries messaging, and the iterative steps required to keep followers consistent with the leader.
The article presents a detailed engineering analysis of RaftKeeper v2.1.0, describing benchmark methodology, performance gains across create, mixed, and list workloads, and four major optimizations—including response serialization parallelism, list‑request handling, system‑call reduction, thread‑pool redesign, and asynchronous snapshot processing—demonstrating substantial throughput and latency improvements in large‑scale ClickHouse deployments.
This article explains the Raft consensus algorithm, its request lifecycle, leader election, snapshot mechanism, and JRaft optimizations such as linear reads, learners, and multi‑raft groups, illustrating how Nacos integrates these concepts to achieve reliable distributed consistency.
This article explains how ByConity uses a high‑availability shared KV store and CAS operations to implement a lightweight, fault‑tolerant leader election mechanism that eliminates the need for external services like Zookeeper, simplifies node management, and ensures safe leader transitions in a cloud‑native data warehouse.
This article explains how RaftKeeper leverages the Raft consensus algorithm to create a high‑availability, high‑performance ClickHouse cluster across multiple data centers, covering project background, architecture, core features, performance optimizations, and real‑world deployment results.
This article explains the Paxos consensus algorithm—its origins, core concepts, roles of proposers, acceptors and learners, safety and liveness constraints, the two-phase protocol, proposal generation, and practical variations—showing why Paxos remains a foundational solution for fault‑tolerant distributed systems.
This article provides a comprehensive introduction to the Paxos consensus algorithm, explaining its purpose, core concepts, roles of proposers, acceptors and learners, safety and liveness properties, and the step‑by‑step derivation of its two‑phase protocol for achieving fault‑tolerant distributed consistency.
This guide walks readers through building a complete Raft consensus system in Go, detailing leader election, log replication, state persistence, snapshotting, and committed‑entry application, while explaining key structures, RPCs, golden rules, and offering advice on using mature libraries versus custom implementations.
This article explains the fundamentals of distributed consensus algorithms, compares Paxos, Zab, and Raft, dives deep into Raft's leader election, log replication, and commit mechanics, and showcases the Java‑based SOFAJRaft library with its architecture, linearizable read optimizations, and real‑world use cases.
Raft is a fault‑tolerant distributed consensus protocol that simplifies Paxos by electing a single leader each term to coordinate client requests, replicate logs to a majority of servers, ensure safety through up‑to‑date voting, handle failures with randomized timeouts, resolve log conflicts, and compress logs via snapshots.
This article explains the ZAB (ZooKeeper Atomic Broadcast) protocol, detailing its atomic broadcast mechanism, two‑phase commit style messaging, transaction IDs (ZXID), leader‑follower coordination, crash recovery principles, data synchronization, and the underlying ZXID design with illustrative code snippets.
This article explains the principles and workflows of Two‑Phase Commit, Paxos, and Raft, detailing their roles, phases, failure handling, and how they achieve distributed consensus in fault‑tolerant systems, including the coordinator‑participant model, proposal numbering, leader election, heartbeat mechanisms, and log replication processes.
This article introduces EPaxos, a leaderless distributed consensus algorithm, explains its motivation from Paxos and Multi‑Paxos, describes its core concepts such as instance spaces, dependencies, and deterministic reordering, and discusses implementation challenges and practical considerations for engineers familiar with Paxos or Raft.
This article explores the evolution of distributed consensus—from Paxos to Multi‑Paxos, Raft, and EPaxos—examining their mechanisms, understandability, efficiency, availability, and suitable scenarios, while providing comparative analysis and thought‑provoking questions for practitioners in modern cloud systems.
This article provides a comprehensive, step‑by‑step explanation of the Paxos consensus algorithm—including its basic principles, roles, prepare and accept phases, Multi‑Paxos extensions, leader election, and state‑machine integration—while offering practical insights for building reliable distributed systems.
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.
This article, the fourth in a series on building a Raft consensus module in Go, explains how to add persistent state, improve command delivery semantics, optimize AppendEntries handling, and handle crash tolerance, while providing concrete Go code examples and practical testing tips.
WPaxos is an open‑source Java implementation of the Multi‑Paxos distributed consensus algorithm that provides high performance, strong consistency, fault tolerance, and extensibility for data‑intensive systems, and includes detailed architecture, feature descriptions, performance benchmarks, and future development plans.
This article provides a thorough introduction to the Raft consensus algorithm, explaining its purpose, core components such as state machine replication, log and consensus module, leader‑follower model, client interaction, fault‑tolerance considerations, the CAP trade‑off, and why Go is a suitable implementation language.
This article introduces the Raft distributed consensus algorithm, explains its core concepts such as replicated state machines, leader‑follower roles, client interaction, fault tolerance, the CAP trade‑off, and why Go is a suitable language for implementing Raft.
This article explains the fundamentals of distributed consistency by introducing the Raft consensus algorithm, covering its roles, leader election, log replication, handling of split votes, random timeouts, and various failure scenarios such as leader crashes and network partitions.
This article explains the Paxos consensus algorithm, its purpose in solving data consistency across distributed nodes, its basic two‑phase workflow with proposer, acceptor, and learner roles, and illustrates three typical scenarios with step‑by‑step examples and code snippets.
This article explains the Paxos consensus algorithm in plain terms, using a relatable travel‑planning analogy to illustrate how proposers, acceptors, and majority voting achieve fault‑tolerant agreement in distributed systems, and connects the concept to real‑world implementations like Google’s Chubby and ZooKeeper.
Elasticsearch 7.0 replaces Zen Discovery with an automatic, quorum‑based cluster‑coordination subsystem that elects master‑eligible nodes, simplifies bootstrapping via cluster.initial_master_nodes, supports safe rolling upgrades, and provides robust fault tolerance through a consensus protocol similar to Paxos or Raft.
This article explains the inner workings of etcd, covering its Raft consensus implementation, node election and state management, as well as the persistent storage layer built on BoltDB, and includes detailed code excerpts to illustrate each component.
This article uses a vivid allegorical story to introduce the Paxos algorithm, then explains its roles, two-phase protocol, fault assumptions, and why majority and multiple acceptors are essential for achieving reliable consensus in distributed systems.
An in‑depth overview of the Raft consensus algorithm explains its server states, RPC mechanisms, leader election process, log replication workflow, safety guarantees, and how the protocol handles failures, illustrated with diagrams and practical examples.
X‑Paxos is Alibaba’s high‑performance, independently designed Paxos library that extends the classic consensus algorithm with multi‑threaded architecture, pluggable logging, adaptive batching and pipelining, and flexible node roles, delivering strong consistency, high availability, and low latency for global distributed databases and services.
This article explains why Paxos is needed for consistency in distributed systems, details its roles and three-phase protocol, illustrates the algorithm with a real‑world analogy, and shows how Paxos underpins high‑availability database replication such as MySQL binlog synchronization.
This article introduces the Paxos consensus algorithm, explains its roles, safety and liveness constraints, describes the challenges of member‑group reconfiguration, and presents a proprietary two‑phase Paxos approach used by Baishan Cloud Storage to safely change cluster membership while maintaining service continuity.
By adapting the classic Two Generals problem into a Three-Armies scenario, this article demystifies the Basic Paxos algorithm, illustrating its prepare/commit phases, proposal handling, and consensus challenges with detailed step-by-step examples and insights into its practical implications for distributed systems.
The article explains that Paxos relies on a fixed set of voters (the majority) for consistency, shows why configuration‑driven member changes break the protocol, and introduces a simple dynamic membership algorithm that uses delayed activation windows to achieve atomic member updates without violating Paxos guarantees.
This article provides a vivid explanation of the Paxos algorithm, illustrating how it achieves reliable consensus among unreliable processors through a two‑phase prepare/promise and propose/accept process, using distributed auction analogies, message sequencing, and read/write operations to ensure consistency in distributed systems.
This article explains the core concepts of Paxos, its role in asynchronous distributed environments, and the practical engineering techniques used to create a production‑ready Paxos library, covering roles, instance management, optimization, checkpointing, and correctness guarantees.
This article explains the Multi-Paxos algorithm, showing how independent Paxos instances can be combined into a globally ordered sequence, how the Prepare phase can be omitted in certain cases, and why a leader emerges naturally to maximize efficiency.
This article provides a beginner-friendly, engineering-focused overview of the production‑grade Paxos library PhxPaxos, explaining the consensus protocol, its roles, instance management, state‑machine integration, performance optimizations, multi‑group deployment, and practical considerations such as disk durability, leader election, and log checkpointing.
ZooKeeper achieves strong data consistency across its server cluster by implementing the Paxos consensus algorithm, where clients propose changes, servers vote on proposals with monotonically increasing IDs, and a leader coordinates writes to ensure only one operation is committed at a time.
