Downloads

Keywords:

Task scheduling, Round Robin, dynamic time quantum, average waiting time, average turnaround time, context switching

Comparative performance analysis of optimized round robin scheduling(ORR) using dynamic time quantum with round robin scheduling using static time quantum in Real Time System

Authors

Pallab Banerjee1 | Biresh kumar2 | Amarnath Singh3 | Rahul Kumar4 | Ritik kumar5

Abstract

One of major component of operating system is task scheduling for the optimum utilization of the resources. Round Robin had been an effective task scheduling method so far, but it has certain limitations. It uses static time quantum which sometimes leads to starvation.  The proposed Optimised Round Robin is a modified version of the existing Round Robin scheduling which results in better average time and average turnaround time and overall increase in the performance. The comparative analysis is being done that indicates ORR gives improvement in the system performance.

Article Details

Published

2019-12-15

Section

Articles

How to Cite

Comparative performance analysis of optimized round robin scheduling(ORR) using dynamic time quantum with round robin scheduling using static time quantum in Real Time System. (2019). International Journal of Engineering and Computer Science, 8(12), 24890-24893. https://doi.org/10.18535/ijecs/v8i12.4399