Operating System Simulations: Scheduling, Deadlock, Memory and Paging
Operating-systems concepts such as scheduling, deadlock and virtual memory are hard to follow on paper because many things change at once. These interactive simulators let you enter your own processes, resource matrices, hole sizes or page-reference strings and step through each decision the operating system makes. You see the ready queue, the Gantt chart, the safe sequence, the memory layout or the page frames update live, with the formulas and results shown beside them.
7 interactive simulations
CPU Process Scheduling
FCFS, SJF, SRTF, Round Robin and Priority — with waiting and turnaround times.
Open simulation →Gantt Chart Visualization
Build the schedule on a timeline, process by process, and compare algorithms.
Open simulation →Process States
New → Ready → Running → Waiting → Terminated, with several processes at once.
Open simulation →Context Switching
Save one process's state, load another's — and the overhead it costs.
Open simulation →Deadlock
Banker's safety algorithm and deadlock detection, step by step.
Open simulation →Memory Management
First/Best/Worst fit allocation and paging address translation.
Open simulation →Page Replacement Algorithms
FIFO, LRU and Optimal — page faults, hits and the victim chosen each time.
Open simulation →Frequently asked questions
Which CPU scheduling algorithms are covered?
First Come First Served, Shortest Job First, Shortest Remaining Time First, Round Robin and Priority scheduling (both non-preemptive and preemptive), with waiting, turnaround and response times and a Gantt chart.
Can I use these to check Banker's algorithm and page replacement homework?
Yes. Enter your own Allocation, Max and Available matrices or your own page-reference string and number of frames, and compare the step-by-step result with your solution.
Which memory management topics are included?
First fit, best fit and worst fit contiguous allocation with fragmentation, paging address translation, and the FIFO, LRU and Optimal page-replacement algorithms.