The CPU scheduler travels the ready queue, allocates the CPU to each process for a time interval of up to 1-time quantum, the process is preempted and the next process in the queue is allocated the CPU. The CPU picks the first process from the ready queue, sets a timer to interrupt after 1-time quantum, and dispatches the process. New processes are added to the tail of the ready queue. The ready queue is treated like a FIFO queue of processes. The ready queue is treated as a circular queue. A time quantum is generally from 10 to 100 milliseconds It is similar to FCFS scheduling except that is a purely preemptive algorithm.Ī small unit of time, called a time quantum or time slice, is defined. ![]() The Round-robin (RR) scheduling algorithm is designed especially for timesharing systems. Round Robin Scheduling Program in C++ What is Round Robin?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |