Performance Analysis of CPU Scheduling Algorithms with Novel OMDRRS Algorithm

CPU scheduling is one of the most primary and essential part of any operating system. It prioritizes processes to efficiently execute the user requests and help in choosing the appropriate process for execution. Round Robin (RR) & Priority Scheduling(PS) are one of the most widely used and acceptable CPU scheduling algorithm. But, its performance degrades with respect to turnaround time, waiting time & context switching with each recurrence. A New scheduling algorithm OMDRRS is developed to improve the performance of RR and priority scheduling algorithms. The new algorithm performs better than the popular existing algorithm. Drastic improvement is seen in waiting time, turnaround time, response time and context switching. Comparative analysis of Turn around Time(TAT), Waiting Time(WT), Response Time (RT) is shown with the help of ANOVA and t-test.

@article{Goel2016,
  title     = {Performance Analysis of CPU Scheduling Algorithms with Novel OMDRRS Algorithm},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {1},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Neetu Goel and Dr. R. B. Garg},
  doi       = {10.14569/IJACSA.2016.070130},
  url       = {https://doi.org/10.14569/IJACSA.2016.070130}
}