A Comparison of 5 Uniprocessor OS Scheduling Policies

In my recent post on Uniprocessor OS Scheduling Policies, I covered the algorithms for five short-term operating system scheduling policies: First-come-first-served Round robin Shortest process next Shortest remaining time Highest response ratio next But I didn’t compare, analyze, or go over the use cases for each policy. I would like to do that in this […]