- Home
- Operating Systems
Operating Systems
What happens inside your computer when many programs run at once: scheduling, memory and deadlocks.
CPU Scheduling (FCFS, SJF, SRTF, Round Robin, Priority)
Which process gets the CPU next? Build Gantt charts in 3D for five classic scheduling algorithms and compare their waiting times.
Process Synchronization (Semaphores & Mutex)
What goes wrong when processes share data — and how semaphores and locks fix it. See the producer–consumer problem and a race condition in 3D.
Deadlock & Banker's Algorithm
How an operating system avoids deadlock by only granting requests that keep the system safe. Run the safety algorithm on 3D bar charts of Allocation, Need and Work.
Memory Allocation (First, Next, Best & Worst Fit)
Free memory is split into holes of different sizes. Which hole should each new process get? Four strategies, four different results.
Paging & Address Translation (TLB)
Split a virtual address into page number and offset, look the page up in the TLB or page table, and build the physical address. Then compute the effective access time.
Paging & Page Replacement (FIFO, LRU, Optimal)
When RAM is full, which page should be thrown out? Watch FIFO, LRU and Optimal handle the same page references — and see Belady's anomaly.
Disk Scheduling (FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK)
Choose the order of disk requests so the read/write head travels as little as possible. Six algorithms race on the same queue.
Dining Philosophers Problem
Five philosophers, five forks, and a table where everyone grabs a fork at once. See deadlock happen and two classic ways to prevent it.
File Allocation Methods
How does the OS remember which disk blocks belong to a file? Compare contiguous, linked and indexed allocation on the same scenario.
About Operating Systems
Operating systems juggle processes, memory and shared resources. These simulators let you schedule processes with FCFS, SJF, SRTF, Round Robin and Priority and read the Gantt chart, count page faults under FIFO, LRU and Optimal replacement, run the Banker's algorithm to avoid deadlock, and watch semaphores keep a producer and a consumer in step. Dining philosophers shows deadlock live, and file allocation compares how disks store files.