hgaurh

 Profile Answers by hgaurh Questions by hgaurh

• Apr 26th, 2007

 

Priority scheduling

In priority scheduling scheduler selects tasks on basis of their priority. The process with higher priority will run first and its completion another will start. The disadvantage is this that processes with lower priority are not given much opportunity to run.


Round Robin Scheduling

It is one of the oldest, simplest, fairest and most widely used scheduling algorithms, designed especially for time-sharing systems. A small unit of time, called timeslice or quantum, is defined. All runnable processes are kept in a circular queue. The CPU scheduler goes around this queue, allocating the CPU to each process for a time interval of one quantum. New processes are added to the tail of the queue.