Analysis of Round Robin Scheduling Algorithms in CPU Scheduling

7 Pages Posted: 12 Jun 2019

Date Written: March 13, 2019

Abstract

CPU scheduling is one of the major task under process management which is one of the most basic and indispensible function of operating system. Round Robin scheduling is a favourable choice for time sharing systems amongst all existing traditional process scheduling algorithms. In this paper, we have analysed six existing variants of traditional Round Robin algorithm and compared them to pick out which one is optimal in reducing the average of turnaround time (TAT), waiting time (WT) and number of context switches by implementing them and testing in different scenarios.

Keywords: Process scheduling, Round Robin scheduling, Context switch, Waiting time, Turnaround time, Response time

Suggested Citation

Srivastava, Aishanya and Kumar, Deepak, Analysis of Round Robin Scheduling Algorithms in CPU Scheduling (March 13, 2019). Proceedings of International Conference on Sustainable Computing in Science, Technology and Management (SUSCOM), Amity University Rajasthan, Jaipur - India, February 26-28, 2019. Available at SSRN: https://ssrn.com/abstract=3351812 or http://dx.doi.org/10.2139/ssrn.3351812

Aishanya Srivastava (Contact Author)

Banasthali Vidyapith ( email )

Banasthali
Newai
Newai
India

Deepak Kumar

Banasthali Vidyapith ( email )

Banasthali
Newai
Newai
India

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
39
Abstract Views
203
PlumX Metrics