0 views collected around this technical thread.
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.
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 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 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.
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 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 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 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.
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 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.