Improving Round Robin Process Scheduling Algorithm | Zendy

Barkha Chhugani | Zendy; Mahima Silvester | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improving Round Robin Process Scheduling Algorithm

Author(s) -

Barkha Chhugani,

Mahima Silvester

Publication year - 2017

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2017914034

Subject(s) - computer science , queue , context switch , turnaround time , scheduling (production processes) , process (computing) , round robin scheduling , algorithm , weighted round robin , quantum , dynamic priority scheduling , real time computing , distributed computing , parallel computing , mathematical optimization , computer network , mathematics , operating system , quality of service , physics , quantum mechanics

Round Robin Algorithm is used for process scheduling by assigning a fixed time quantum to every process which has to be executed. In this type of process scheduling, each process waiting in a ready queue is executed for a particular time quantum. If the burst time of the process is finished in one go then the process is removed from the ready queue. Otherwise, it is returned to the ready queue for its next quantum turn. In our proposal, we have calculated a dynamic time quantum for a process which fits to certain dynamically calculated conditions that we have defined later in the module due to which parameters like average turnaround time, average waiting time and the numbers of context switches have been decreased as compared to the standard Round Robin.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research