⚡ SnapGyan by Tejav

Any concept.
clear in 60 seconds.

I'm preparing for

Topic

distributed systems

21 shorts across 1 course, in learning order

🎛️ Narrow down2▾

Results · 15 for “Concept of distributed systems”

← Front page

✨ Smart search: matched by meaning, not just words

⚡ 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.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

Leader Election in Distributed Systems Explained

Leader election helps distributed systems select one coordinator from many nodes.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

Consistent Hashing: Key to Distributed Systems Scalability

Consistent hashing helps distribute data across servers with minimal movement.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

Understanding RPC: Remote Procedure Calls in Distributed Systems

RPC allows one service to call a function in another service over the network.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

Leader Election in Distributed Systems: Handling Leader Failures

Leader election ensures a single node coordinates tasks in distributed systems, even after failures.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

Understanding Quorum and Majority in Distributed Systems

Quorum and majority help distributed systems maintain data consistency and availability.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

HLD: Fail-Stop vs Fail-Recover Explained

Fail-stop means a system stops and stays down, while fail-recover means it can come back but needs to be ready.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ 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.

Medium5m5 MCQs

⚡ One HLD concept. 60 seconds. Interview ready

ZooKeeper Watches: Avoiding the Thundering Herd Problem

ZooKeeper watches notify clients of changes, avoiding constant polling and reducing server load.

Medium5m5 MCQs

🧠Related by meaning

Not tagged “distributed systems”, but closely connected