An application based improved round robin CPU scheduling for real time operating system
Abstract
CPU scheduling is the primary and very important part of any operating system. CPU scheduling
criteria is based on multi programming operating system. CPU executes one process at a time and
other process is in waiting state to be executed. It prioritizes processes to efficiently execute the
user requests and help in choosing the appropriate process for execution. Whatever the main goal
of CPU scheduling is to minimize the average waiting time, turnaround time and also the context
switching in order to make the best use of CPU. ln this state, our main goal is to build such
model in which Process with the shortest burst time with a dynamic time quantum calculated by
using median formula executed first and so on until the ready queue is not empty. Implementing
this idea, we can minimize the average turnaround time, waiting time and also reduce the context
switch over traditional RR. To implement this idea, we have developed a simulation software to
view the experimental result whether it fulfill our requirement or not. However, we hope that in future we can extend it to a more advanced way.