We saw in class that choosing the length of a \"CPU quantum\" (the minimum time

Question

We saw in class that choosing the length of a "CPU quantum" (the minimum time a process chosen by the OS CPU scheduler will be guaranteed to run provided it is ready to do so and no interrupts arrive to necessitate its preemption) involves negotiating a complex trade-off between responsiveness and the direct overheads of context switching. Consider the analogous problem of choosing the quantum length to be used by the scheduler within your user-level threads package. What is the lowest value you can realize for this and why?

Explanation / Answer

With round robin scheduling, interactive performance depends on the length of the quantum and the number of processes in the run queue. A very long quantum makes the algorithm behave very much like first come, first served scheduling since it

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.