Open AccessImprovisation of Round Robin Algorithm
Author(s) -
Aishna Gupta,
Patil Darshan Rajkumar
Publication year - 2022
Publication title -
international journal of innovative research in computer science and technology
Language(s) - English
Resource type - Journals
ISSN - 2347-5552
DOI - 10.55524/ijircst.2022.10.1.10
Subject(s) - turnaround time , computer science , improvisation , sorting , scheduling (production processes) , algorithm , real time computing , mathematical optimization , operating system , mathematics , art , visual arts
We are trying to improvise the existing Round Robin Algorithm and test its performance across host OS and VM as well. We would be testing the performance of the improvised algorithm on the Cent OS running on Virtual Box.. We have worked on the scheduling algorithm specifically Round Robin Scheduling in our lab classes. Basically, we will be finding out the best way to properly select the “Time Quantum” so as to get Minimum ‘Waiting Time’ and ‘Turnaround Time’. After looking into so many research papers, we have found that, by sorting the processes in increasing order of their burst time and taking median of all the burst time, we can minimize the waiting and turnaround time.