💻 分散並列コンピューティング

Blockchain Mining & ConsensusNewInteractive 3D simulation of proof-of-work mining and longest-chain consensus: independent… CAP Theorem Cluster SimulatorNewInteractive CAP theorem simulator: split a replicated node cluster with a network partition… Cloud vs Edge Latency SimulatorNewInteractive 3D race between a cloud round trip and on-device edge processing: watch… Blockchain Network SimulatorNewInteractive 3D peer-to-peer gossip network: watch nodes mine and propagate blocks hop by hop… IoT Message Broker SimulatorNewInteractive 3D model of an IoT platform's message broker: tune connected device count,… Apache Airflow DAG SchedulerNewWatch an Airflow-style scheduler walk a directed acyclic graph of tasks: eligible tasks… Apache Spark Distributed ExecutionNewWatch a Spark job run: a driver splits stages into tasks, ships them to executors that run… API Request Lifecycle Simulator: Gateway, Rate Limiting, Auth & MicroservicesNewWatch REST API requests flow from a client through an API Gateway into three microservices… Distributed Computing - Comprehensive GuideNewThis simulation provides a foundational understanding of distributed computing principles.… Distributed Systems — Consistency, Availability, and Partition ToleranceNewThis simulation focuses on distributed system design principles. It illustrates the… The Paxos Consensus Protocol: How Distributed Systems Agree on One ValueNewExplore how the Paxos consensus protocol lets unreliable, message-losing nodes agree on a… Vector Clocks: Ordering Events Without a Shared ClockNewLearn how vector clocks let distributed machines figure out which events caused which,… Two-Phase Commit: How Distributed Databases Agree to Commit or Abort TogetherNewExplore the two-phase commit protocol that lets distributed databases guarantee atomicity… The Circuit Breaker Pattern: Stopping Cascading Failures in Software SystemsNewExplore how the circuit breaker pattern, borrowed from electrical engineering, protects… The Bully Algorithm: Electing a Leader in a Distributed System by Highest IDNewExplore the classic Bully Algorithm for leader election in distributed systems, tracing the… Chain Replication: A Simpler Way to Keep Distributed Data ConsistentNewExplore chain replication, the 2004 van Renesse and Schneider technique that arranges… MVCC: How Databases Let Readers and Writers Work Without Blocking Each OtherNewExplore Multi-Version Concurrency Control (MVCC), the technique behind PostgreSQL, MySQL… Write-Ahead Logging: How Databases Survive a CrashNewExplore write-ahead logging (WAL), the protocol that lets PostgreSQL, MySQL, and filesystems… CRDTs: Merging Data Without a Central CoordinatorNewExplore conflict-free replicated data types, distributed data structures that let… Gossip Protocol: How Clusters Spread Information Like an EpidemicNewExplore gossip protocols, where nodes randomly exchange state with peers so updates spread… Rendezvous Hashing: Highest Random Weight AssignmentNewExplore Rendezvous Hashing (Highest Random Weight), a ring-free technique where every node… Hybrid Logical Clocks LabNewExplore Hybrid Logical Clocks (HLC), a timestamping scheme that blends physical wall-clock… The Chandy-Lamport Distributed Snapshot AlgorithmNewExplore how the Chandy-Lamport algorithm captures a consistent global snapshot of a… Kademlia Distributed Hash TableNewExplore how Kademlia lets thousands of peers find data without any central server, using XOR… Google Spanner's TrueTime API: Turning Clock Uncertainty into a Global GuaranteeNewExplore how Google Spanner's TrueTime API exposes clock uncertainty as an explicit time… Bloom Filter — Probabilistic Set MembershipNewA Bloom filter tests set membership with k hash functions over a bit array: no false… Consistent Hashing — The Hash RingNewMap keys and servers onto a hash ring so adding or removing a node only remaps a small… Load Balancer — Request Distribution PoliciesNewRoute incoming requests across backend servers with round-robin, least-connections, weighted… CPU Scheduling — FCFS, SJF, Round RobinNewSchedule processes on a CPU with FCFS, SJF, priority and round-robin policies. An animated… Page Replacement — LRU, FIFO & OptimalNewRun a reference string through FIFO, LRU, Clock and Optimal page-replacement policies,… Dining Philosophers — Deadlock & ConcurrencyNewFive philosophers share five forks: grab both naively and they deadlock. Toggle resource… Distributed ConsensusNewRaft consensus algorithm, CAP theorem and Byzantine fault tolerance in distributed systems.