Interactive Systems Labs
Directly manipulate algorithmic parameters, trigger failure modes, inspect bit arrays, and observe state transitions in real time.
Bloom Filter Bit Array & Collision Dynamics
Test set membership, inspect bit flipping under independent hash functions, and observe how fill ratio drives the theoretical false positive rate: p ≈ (1 - e-kn/m)k. Connected to curriculum lesson: CORE-M08-001: Bloom Filters.
Bloom Filter Live Simulator
Explore bit arrays, hash function distribution, collision dynamics, and false positive rates.
Consistent Hashing Ring & Virtual Nodes (V)
Observe token allocation on a 32-bit ring, clockwise key ownership, and key rebalancing during node addition and removal. Connected to curriculum lessons: CORE-M08-002: Consistent Hashing and CORE-M19-001: Partitioning & Sharding.
Consistent Hashing Ring Simulator
Observe token distribution, virtual nodes (V), clockwise key routing, and minimal migration when cluster membership changes.
Raft Consensus Algorithm & Split-Brain Resilience
Step through leader election timeouts, term increment monotonicity, write log replication, and simulate network partitions to witness why minority partitions cannot commit. Connected to curriculum lessons: INF-I02-001: Raft Consensus and CORE-M21-001: Distributed Consensus.
Raft Consensus Algorithm Live Simulator
Step through leader election, term monotonicity, log replication quorums, and network partition split-brain resilience.
PagedAttention & GPU KV Cache Virtual Memory
Inspect how modern high-throughput LLM serving platforms (vLLM) solve GPU memory fragmentation by dividing the key-value cache into discrete physical memory blocks and implementing copy-on-write prefix caching. Connected to curriculum lessons: AI-C03-001: LLM Inference Foundations and AI-C05-001: High-Throughput LLM Serving.
GPU VRAM & PagedAttention KV Cache Simulator
Inspect how modern LLM inference engines (vLLM) eliminate memory fragmentation using OS-style virtual memory paging, block tables, and copy-on-write prefix caching.
Adaptive Rate Limiter & Overload Protection
Test Token Bucket, Leaky Bucket (traffic shaping), and Sliding Window counter behavior in real time against synthetic bursty request arrivals and overload spikes. Connected to curriculum lessons: CORE-M23-001: Resilience Engineering and APP-A02-001: Distributed Notification Platform.
Adaptive Rate Limiter & Overload Protection Simulator
Compare Token Bucket, Leaky Bucket (Traffic Shaping), and Sliding Window algorithms under real-time bursty workloads and traffic spikes.
Vector Clocks & CRDT Conflict-Free Replication
Simulate multi-master geographical replication across New York, Frankfurt, and Tokyo. Inspect causality tracking via Vector Clocks, induce simulated network partitions, and observe mathematical state convergence through Join-Semilattices (⊔). Connected to curriculum lessons: APP-A10-001: Collaborative Editing & CRDTs and CORE-M18-001: Distributed Replication.
Vector Clocks & CRDT Conflict-Free Replication Simulator
Observe causality tracking with Vector Clocks ⟨vA, vB, vC⟩, test concurrent network partitions, and watch state-based OR-Sets mathematically converge via Join-Semilattice least upper bound (⊔).
Interactive TypeScript Simulation Playground
Directly inspect, edit parameters, and execute the complete suite of 94 distributed algorithms, storage engines, and AI infrastructure simulations directly in the browser—or copy terminal commands to run them natively with Node.
94 Runnable Architecture Simulations
Full implementations covering Multi-Paxos, PBFT, Raft, TrueTime vs HLC, LSM-Trees, Continuous Batching, Ring All-Reduce, Flash Sale reservation, and distributed KV stores.