BiteSizedChunks.comLearn one small thing at a time.

Courses Suggested Paths Pricing

Course contentsShowHide

Operating Systems

218Scheduling criteria: utilization, throughput, turnaround, waiting, response
219CPU bursts and I/O bursts
220Preemptive versus non-preemptive scheduling
221Dispatcher latency
222Long-term, medium-term and short-term schedulers
223Gantt charts for schedule analysis
224Convoy effect
225Starvation and aging
226Priority inversion
227Priority inheritance protocol
228Priority ceiling protocol
229Mars Pathfinder priority inversion
230Scheduling in batch, interactive and real-time systems
231Predicting CPU bursts by exponential averaging
232Context-switch overhead in schedulers
233Scheduler ticks and tickless kernels
234High-resolution timers
235Load balancing between CPUs
236First-come, first-served scheduling
237Shortest job first
238Shortest remaining time first
239Highest response ratio next
240Round robin scheduling
241Choosing the quantum for round robin
242Non-preemptive priority scheduling
243Preemptive priority scheduling
244Multilevel queue scheduling
245Multilevel feedback queue scheduling
246Lottery scheduling
247Stride scheduling
248Fair-share scheduling
249Guaranteed scheduling
250Earliest deadline first
251Rate-monotonic scheduling
252Least laxity first
253Deadline-monotonic scheduling
254Gang scheduling
255Co-scheduling
256Highest priority first with round robin
257Feedback scheduling with aging
258Two-level scheduling
259Proportional-share scheduling
260Borrowed virtual time
261Brain Fuck Scheduler
262Round-robin analysis worked example
263SJF analysis worked example
264MLFQ rules from OSTEP
265The Linux O(n) scheduler
266The Linux O(1) scheduler
267The Completely Fair Scheduler design
268Virtual runtime in CFS
269Red-black trees in CFS
270Nice values and weights
271Scheduling classes in Linux
272SCHED_OTHER, SCHED_BATCH and SCHED_IDLE
273SCHED_FIFO and SCHED_RR
274SCHED_DEADLINE
275EEVDF scheduler
276Scheduler domains and groups
277NUMA-aware scheduling
278Energy-aware scheduling
279CPU frequency scaling and governors
280big.LITTLE scheduling
281cgroup CPU controller and shares
282CFS bandwidth throttling
283sched_setaffinity
284chrt and taskset tools
285The Windows scheduler and priority levels
286Windows quantum and priority boosts
287Windows multimedia class scheduler
288The FreeBSD ULE scheduler
289The macOS scheduler and QoS classes
290Solaris scheduling classes
291Android scheduling and cgroups
292Hyperthreading and SMT scheduling
293Core scheduling against side channels
294sched_ext extensible scheduling

Operating Systems

218Scheduling criteria: utilization, throughput, turnaround, waiting, response
219CPU bursts and I/O bursts
220Preemptive versus non-preemptive scheduling
221Dispatcher latency
222Long-term, medium-term and short-term schedulers
223Gantt charts for schedule analysis
224Convoy effect
225Starvation and aging
226Priority inversion
227Priority inheritance protocol
228Priority ceiling protocol
229Mars Pathfinder priority inversion
230Scheduling in batch, interactive and real-time systems
231Predicting CPU bursts by exponential averaging
232Context-switch overhead in schedulers
233Scheduler ticks and tickless kernels
234High-resolution timers
235Load balancing between CPUs
236First-come, first-served scheduling
237Shortest job first
238Shortest remaining time first
239Highest response ratio next
240Round robin scheduling
241Choosing the quantum for round robin
242Non-preemptive priority scheduling
243Preemptive priority scheduling
244Multilevel queue scheduling
245Multilevel feedback queue scheduling
246Lottery scheduling
247Stride scheduling
248Fair-share scheduling
249Guaranteed scheduling
250Earliest deadline first
251Rate-monotonic scheduling
252Least laxity first
253Deadline-monotonic scheduling
254Gang scheduling
255Co-scheduling
256Highest priority first with round robin
257Feedback scheduling with aging
258Two-level scheduling
259Proportional-share scheduling
260Borrowed virtual time
261Brain Fuck Scheduler
262Round-robin analysis worked example
263SJF analysis worked example
264MLFQ rules from OSTEP
265The Linux O(n) scheduler
266The Linux O(1) scheduler
267The Completely Fair Scheduler design
268Virtual runtime in CFS
269Red-black trees in CFS
270Nice values and weights
271Scheduling classes in Linux
272SCHED_OTHER, SCHED_BATCH and SCHED_IDLE
273SCHED_FIFO and SCHED_RR
274SCHED_DEADLINE
275EEVDF scheduler
276Scheduler domains and groups
277NUMA-aware scheduling
278Energy-aware scheduling
279CPU frequency scaling and governors
280big.LITTLE scheduling
281cgroup CPU controller and shares
282CFS bandwidth throttling
283sched_setaffinity
284chrt and taskset tools
285The Windows scheduler and priority levels
286Windows quantum and priority boosts
287Windows multimedia class scheduler
288The FreeBSD ULE scheduler
289The macOS scheduler and QoS classes
290Solaris scheduling classes
291Android scheduling and cgroups
292Hyperthreading and SMT scheduling
293Core scheduling against side channels
294sched_ext extensible scheduling

← Operating Systems

Search the Operating Systems glossary

Lesson 251 of 2,075·9. CPU Scheduling AlgorithmsFree lesson

Rate-monotonic scheduling

Writing your lesson…

← Previous Next lesson →

© 2026 BiteSizedChunks.com. Learn one small thing at a time.

Glossary Contact Terms of Service Privacy Policy