Interactive Animated Learn by doing
Operating System
Algorithms, Visualized
Step through CPU scheduling, memory management, disk I/O and
concurrency algorithms with interactive visualizations. Built for
learners, educators and curious minds.
Visualizations
Explanations
Algorithms
Explore Modules
Choose a module to start learning. Each module contains interactive visualizations, examples and comparisons.
Visualize how the OS dispatches processes on the CPU. Compare waiting time, turnaround time and response time.
FCFSSJFSRTFRound Robin Multiprocessor SchedulingSchedulingExplore how multicore systems preserve cache locality, redistribute load and co-schedule parallel tasks.
AffinityLoad BalancingGang Scheduling Page ReplacementMemorySee how virtual memory page frames are managed. Track page faults and hits step-by-step.
FIFOLRULFUOptimal Disk SchedulingStorageAnimate the disk read/write head movement across cylinders and compare seek distances using different algorithms.
FCFSSSTFSCANC-SCAN Deadlock — Banker's AlgorithmConcurrencyInput resource allocation and maximum demand matrices. Find safe sequences or identify unsafe states.
Safety AlgorithmNeed MatrixSafe Sequence Memory AllocationMemoryExplore how contiguous memory is partitioned and assigned to processes. Compare allocation strategies.
First FitBest FitWorst FitNext Fit Process SynchronizationConcurrencyStep through classic synchronization problems with animated visualizations.
Producer ConsumerReader WriterDining PhilosophersPeterson File AllocationStorageCompare how file systems place blocks on disk and how metadata changes.
ContiguousLinkedIndexedFATInode Paging & Address TranslationMemoryBreak logical addresses into page, offset and frame mappings. Visualize page tables and address translation.
PagingSegmentationBuddyCompaction I/O and Device FlowI/OVisualize interrupt handling, DMA, spooling and device queue scheduling as ordered pipelines.
InterruptsDMASpoolingQueues