sandbox
Every algorithm from the Operating Systems course, merged into one dashboard that runs in your browser.
Who gets the CPU next.
Four schedulers pick the next process from the ready queue. Edit arrival and burst times, then compare the Gantt charts and waiting times they produce.
Grant nothing unsafe.
The Banker's algorithm checks every resource request against a safe sequence before it hands anything out, and shows the Allocation, Max and Need matrices as it goes.
Share without collisions.
Semaphores, a writer lock and five forks. Three classic problems show how processes share a resource without corrupting it or waiting on each other forever.
Move the head less.
Six disk schedulers work through a queue of cylinder requests. Each one draws the path of the read/write head and totals the cylinders it travels.
Fit it in. Fault less.
Place processes into free blocks with First, Best and Worst Fit. Then step through FIFO, LRU and Optimal page replacement one reference at a time.
One sandbox. Every module.
Fourteen teams built their pieces separately against one shared contract. Team 15 merged them without changing a line of their code.