Decide which process runs next using policies like round robin.
A process has its own address space; threads share one. Schedulers choose which ready task runs: FCFS, SJF, round robin, priority, multilevel feedback queue. Metrics: throughput, turnaround, waiting, response time and fairness. Context switches have overhead.
Round robin with 10 ms quanta shares CPU fairly among interactive tasks.
Scheduling decides which process gets the processor, which affects responsiveness, fairness and throughput.
Decide which process runs next using policies like round robin.
Scheduling decides which process gets the processor, which affects responsiveness, fairness and throughput.
Each process gets a fixed time slice in turn, which gives fair sharing but may not suit tasks with different urgencies.
Interrupting a running process so another can run, which allows fast response to urgent tasks.
Typical applications include choosing a scheduling policy that keeps a user interface responsive, assigning priorities to real-time tasks on an embedded system and comparing round robin and priority scheduling for a server.
Study "Operating systems" first (topic 58 of 104 in Software & Computing). It covers the groundwork this topic builds on.
Process states. Time slices. Starvation and aging.
Round robin with 10 ms quanta shares CPU fairly among interactive tasks.
The next topic is "Virtual memory", which builds directly on this one.
It is classed as Intermediate in Software & Computing (topic 59 of 104). It is an intermediate topic. Work through the beginner topics in Software & Computing first.
Want to practise? Open the interactive course for quick checks, quizzes, simulations and progress tracking.