The round robin scheduling algorithm is designed especially for time sharing systems. It is similar to First Come First Serve scheduling, but preemption is added to switch between processes. A small unit of time, called a time quantum or time slice, is defined. A time quantum is generally from 10 to 100 milliseconds. The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to 1 time quantum.
http://www.thefrustratedyouth.com/what-is-round-robin-scheduling-in-operating-system/
http://www.thefrustratedyouth.com/what-is-round-robin-scheduling-in-operating-system/
0 comments:
Post a Comment