A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure

03/03/2014
by   Sanjaya Kumar Panda, et al.
0

Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. It is basically used in a time sharing operating system. It switches from one process to another process in a time interval. The time interval or Time Quantum (TQ) is fixed for all available processes. So, the larger process suffers from Context Switches (CS). To increase efficiency, we have to select different TQ for processes. The main objective of RR is to reduce the CS, maximize the utilization of CPU and minimize the turn around and the waiting time. In this paper, we have considered different TQ for a group of processes. It reduces CS as well as enhancing the performance of RR algorithm. TQ can be calculated using min-max dispersion measure. Our experimental analysis shows that Group Based Time Quantum (GBTQ) RR algorithm performs better than existing RR algorithm with respect to Average Turn Around Time (ATAT), Average Waiting Time (AWT) and CS.

READ FULL TEXT
research
04/23/2014

An Effective Round Robin Algorithm using Min-Max Dispersion Measure

Round Robin (RR) scheduling algorithm is a preemptive scheduling algorit...
research
09/14/2011

Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time

CPU being considered a primary computer resource, its scheduling is cent...
research
04/24/2014

Enhancing CPU Performance using Subcontrary Mean Dynamic Round Robin (SMDRR) Scheduling Algorithm

Round Robin (RR) Algorithm is considered as optimal in time shared envir...
research
03/20/2011

A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis

Scheduling is the central concept used frequently in Operating System. I...
research
11/22/2011

A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average

Round Robin, considered as the most widely adopted CPU scheduling algori...
research
03/20/2011

A New Dynamic Round Robin and SRTN Algorithm with Variable Original Time Slice and Intelligent Time Slice for Soft Real Time Systems

The main objective of the paper is to improve the Round Robin (RR) algor...
research
08/01/2022

Gradient-descent quantum process tomography by learning Kraus operators

We perform quantum process tomography (QPT) for both discrete- and conti...

Please sign up or login with your details

Forgot password? Click here to reset