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

  • Banerjee P
  • Kumar B
  • Singh A
  • et al.
N/ACitations
Citations of this article
81Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Banerjee, P., Kumar, B., Singh, A., Kumar, R., & Kumar, R. (2019). 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. International Journal of Engineering and Computer Science, 8(12), 24890–24893. https://doi.org/10.18535/ijecs/v8i12.4399

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free