A Novel And Efficient Round Robin Algorithm With Intelligent Time Slice And Shortest Remaining Time First
2018; Elsevier BV; Volume: 5; Issue: 5 Linguagem: Inglês
10.1016/j.matpr.2018.02.175
ISSN2214-7853
Autores Tópico(s)Embedded Systems Design Techniques
ResumoRound Robin algorithm is the immensely utilized process scheduling algorithm. It is the combination of pre-emption and first come first serve scheduling algorithm. Time slices are allocated to processes in a circular fashion. The time slice for all the processes is already fixed. So if the burst time of a process is equal to or less than the Time slice then the process completes execution and gets removed from the ready queue else it goes back into the queue to complete its execution. Round robin is free from starvation and gives a fair allocation to every process. However there are few performance issues. In this paper I have designed an intelligent Round Robin algorithm which will use variable time quantum with Shortest Remaining Time First algorithm thereby enhancing the performance of Round Robin algorithm by reducing the average waiting time and Turnaround time.
Referência(s)