I'm preparing for
Topic
distributed systems
60 shorts across 1 course, in learning order
🎛️ Narrow downsubject · level · topic1▾
Results · 19 for “Basic understanding of messaging systems”
← Front page✨ Smart search: matched by meaning, not just words

⚡ One HLD concept. 60 seconds. Interview ready
Message Delivery Semantics: At-Most-Once vs At-Least-Once vs Exactly-Once
Message delivery semantics define how messages are sent in distributed systems and handle failures.

⚡ One HLD concept. 60 seconds. Interview ready
Kafka Exactly-Once Processing: Avoiding Duplicates
Kafka can help ensure messages are processed once, but requires careful design.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Lamport Timestamps in Distributed Systems
Lamport Timestamps help order events in distributed systems while preserving causality.

⚡ One HLD concept. 60 seconds. Interview ready
HLD: Synchronous vs Asynchronous Communication Explained
Synchronous communication waits for a response, while asynchronous continues without waiting.

⚡ One HLD concept. 60 seconds. Interview ready
Kafka Backpressure Strategies: Handling Traffic Spikes
Backpressure helps manage message flow in Kafka during traffic spikes.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Network Partitions in Distributed Systems
Network partitions occur when servers are operational but can't communicate, affecting system performance.

⚡ One HLD concept. 60 seconds. Interview ready
Paxos Consensus: Understanding Distributed Agreement
Paxos is a protocol that helps distributed systems agree on one value despite failures.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding gRPC Architecture: Behind the Call
gRPC allows efficient communication between services using a structured request-response model.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Causality in Distributed Systems
Causality in distributed systems helps understand how events influence each other, beyond just timestamps.

⚡ One HLD concept. 60 seconds. Interview ready
HLD: Crash Failures vs Network Failures in Distributed Systems
Crash failures stop a service, while network failures disrupt communication.

⚡ One HLD concept. 60 seconds. Interview ready
Distributed Backpressure: Managing Service Overload
Distributed backpressure helps manage the flow of work between services to prevent overload.

⚡ One HLD concept. 60 seconds. Interview ready
Log Replication and Majority Commit in Distributed Systems
Log replication ensures data consistency by requiring majority acknowledgment before committing changes.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Distributed Clocks in Systems Design
In distributed systems, timestamps don't always reflect the true order of events.

⚡ One HLD concept. 60 seconds. Interview ready
Kafka Consumer Concurrency: Understanding Partitions and Threads
Kafka's parallel processing depends on partitions, not just consumers or threads.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Physical vs Logical Time in Distributed Systems
Physical time tells when events happen, while logical time tells their order.

⚡ One HLD concept. 60 seconds. Interview ready
FAANG HLD 🔥 | Raft vs Paxos — What's the Difference? Consensus Explained! ⚡
Raft and Paxos are protocols that help computers agree on values in distributed systems.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Consistency Models in Distributed Systems
Consistency models determine what data reads in distributed systems can see.

⚡ One HLD concept. 60 seconds. Interview ready
Leader Election Algorithms: Bully vs Raft vs ZooKeeper
Bully, Raft, and ZooKeeper are distinct algorithms for leader election in distributed systems.

⚡ One HLD concept. 60 seconds. Interview ready
Understanding Consensus in Distributed Systems
Consensus ensures that distributed systems can agree on decisions even during failures.
🧠Related by meaning
Not tagged “distributed systems”, but closely connected


