Loading...
Loading...
CAP theorem, PACELC, consensus algorithms (Raft), leader election, and distributed transactions.
Guarantees that a cluster of nodes agrees on state changes even in the presence of node crashes or network delays.
Raft breaks consensus into leader election, log replication, and safety. A leader accepts commands and replicates log entries to a majority quorum.
Top FAANG and tier-1 system design interview questions.
How do you implement distributed transactions across microservices without 2PC?
Use the Saga Pattern (Orchestration or Choreo-graphy) with compensating transactions to undo actions if a step fails downstream.