Skip to content

Rahul Suryawanshi

  • Home
  • Technology
    • Distributed Systems
    • System Design & Architecture
    • Platform Engineering
    • Cloud & DevSecOps
    • AI & Generative AI
    • Quantum Computing
  • Distributed Systems
    • Series Overview
    • Part 1 — Foundations
      • What Is a Distributed System?
      • System Models
      • Network Model
      • Failure Model
      • Time Model
    • Part 2 — Communication & Coordination
      • Reliability & Retries
      • Service Discovery
      • Distributed Locks
      • Coordination Services
    • Part 3 — Replication, Consistency & Consensus
      • Consistency Models
      • CAP Theorem
      • Paxos vs Raft
      • Quorums & Voting
    • Part 4 — Fault Tolerance & High Availability
      • Fault Tolerance vs High Availability
      • Failure Detection
      • Observability
    • Part 5 — Scalability & Performance
    • Eight Fallacies of Distributed Computing
  • Engineering Leadership
  • About
    • Experience
    • AI Journey
    • Balto
    • Travel Stories
  • Contact

Read-Repair

Quorums and Voting in Distributed Systems Explained

April 7, 2026March 27, 2026 by Rahul Suryawanshi

How quorums work in distributed systems — the W + R > N rule explained with worked examples, strict vs sloppy quorums, read repair and practical configuration guidance for Cassandra, DynamoDB and Riak.

Categories Distributed Systems Tags CAP Theorem, Consistency, Distributed Systems, Fault Tolerance, Quorums, Read-Repair, Reliability Engineering, Replication, Sloppy Quorum, System Design
  • Technology
  • Distributed Systems
  • System Design
  • Platform Engineering
  • Engineering Leadership
  • About
  • Contact
© 2026 Rahul Suryawanshi • Built with GeneratePress
 

Loading Comments...