Scheduling

CPU time is limited and everyone wants a turn. Covers FIFO, SJF, round robin, MLFQ, proportional share, and the cost of fairness.

0 / 15 solved

Question Tags Difficulty Success

1. Shortest Job First

sjfoptimal +3

Medium 92%

Concurrency

Medium 74%

3. Five Steps Nicer

cfsnice-value +2

Medium 46%

mlfqpriority +3

Medium 71%

5. Twenty Nine Versus One

schedulingturnaround-time +2

Medium 87%

6. MLFQ Gaming Prevention

mlfqgaming +3

Medium 90%

7. Nine Five And Two

stcfturnaround-time +2

Medium 50%

8. Amortizing The Switch

context-switchtime-slice +2

Medium 60%

9. Forty Hour Jobs

sjfstarvation +2

Medium 40%

10. Forty Milliseconds Each

cfsvruntime +2

Hard 68%

11. Ninety Nine Percent Trick

mlfqstarvation +2

Hard 66%

12. Priority Inversion

Operating SystemsConcurrency

Hard 70%

13. Yielding At Nine Milliseconds

mlfqgaming-the-scheduler +2

Hard 50%

14. Boost Or Starve

mlfqpriority-boost +2

Hard 64%

15. The Granularity Floor

cfsvruntime +2

Hard 63%

sjfoptimalturnaround_timeschedulingosConcurrencycfsnice-valuecpu-sharemlfqprioritycpu_boundturnaround-timeresponse-timeround-robingamingaccountingstcfscheduling-tracecontext-switchtime-sliceamortizationtimer-interruptstarvationagingscheduling-policyvruntimenice-levelsproportional-sharescheduler-gamingOperating Systemsgaming-the-schedulerallotmentpriority-boostcalculationnice-weightsmin-granularity+1+2+3+4+5

Learning Resources

Operating Systems: Three Easy Pieces, Chapters 7 to 10

Up next

15 of 15 questions here are still unsolved.

Next module IPC & System Calls