Round Robin Scheduling SHREEVYAS H M This presentation

Round Robin Scheduling. SHREEVYAS H M This presentation is targeted for ECE stream of UG students This work is licensed under a Creative Commons Attribution-Non. Commercial 4. 0 International License

Learning Objectives • • • Introduction to Round Robin Scheduling State of the art Advantages and disadvantages of RR Numerical on RR Summary

Round Robin (RR) Scheduling • One of the oldest, simplest, most commonly used scheduling algorithm • Select process/thread from ready queue in a round-robin fashion (take turns) • RR is one of the algorithms employed by process and network schedulers in computing. • The name of the algorithm comes from the roundrobin principle known from other fields, where each person takes an equal share of something in turn

RR Scheduling (cont. ) • To schedule processes fairly, a round-robin scheduler generally employs time-sharing, giving each job a time slot or quantum

Numerical on RR scheduling Process P 1 P 2 P 3 Burst Time 24 3 3 Gantt Chart

Summary • Disadvantages • More Context switches • More waiting time • Advantages • Response time is good • Round Robin is excellent for Parallel computing is because round-robin is great for load balancing • it is very easy to implement and often is easier to translate into things such as hardware via table lookups

References • Silberschatz, A. , Galvin, P. , Gagne, G. : Operating System Concepts, 7 th edn. John Wiley & Sons, Chichester (2005) • Suranauwarat, S. : A CPU Scheduling Algorithm Simulator. In: WI 37 th ASEE/IEEE Frontiers in Education Conference, Milwaukee, October 10 -13 (2007)