Round-Robin Scheduling


C) Round-Robin Scheduling :    The  ROUND-ROBIN  scheduling is designed especially  for  time sharing systems. A small unit of time, called time quantum is  defined. A  time quantum is generally from 10 to 100 milli seconds.  The  ready queue is treated as a circular queues. The CPU scheduler  goes  around the ready queue, allocating the CPU to each process for a time interval up to a quantum in length.

If the process has a CPU  burst less than the time quantum,  the process  itself releases the CPU voluntarily. Then the next job in  the queue is taken up. Otherwise, the status of he process is saved and CPU takes up the next job in the queue. The following example illustrates.

 

Monday 1 October 2012

Round-Robin Scheduling


C) Round-Robin Scheduling :    The  ROUND-ROBIN  scheduling is designed especially  for  time sharing systems. A small unit of time, called time quantum is  defined. A  time quantum is generally from 10 to 100 milli seconds.  The  ready queue is treated as a circular queues. The CPU scheduler  goes  around the ready queue, allocating the CPU to each process for a time interval up to a quantum in length.

If the process has a CPU  burst less than the time quantum,  the process  itself releases the CPU voluntarily. Then the next job in  the queue is taken up. Otherwise, the status of he process is saved and CPU takes up the next job in the queue. The following example illustrates.