Mini-project
IT, Software & SaaS
CPU scheduler simulator and comparison
Simulate how an operating system schedules processes and compare algorithms on waiting time and fairness.
The brief
The scheduler decides which program runs next, and a poor choice makes a computer feel slow. Build a simulator for first-come, shortest-job, round-robin and multilevel queue scheduling, run each on realistic workloads, and compare waiting time, response time and fairness. Good looks like: results that match textbook examples, workloads that mix short and long jobs, and a recommendation for different uses.
What you will build
- Define processes with arrival and burst times
- Implement the four algorithms
- Check against textbook examples
- Generate realistic workloads
- Compare waiting time, response time and fairness
- Plot Gantt charts and write conclusions
Free, open data to build it with
Sign up free to get the data and links
It takes a minute with your email. AiTeky Pass (₹999/month or ₹9,999/year) is free for your first 30 days.