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

2011/03/20 by Himanshu Sekhar Behera, Behera, H. S., Rakesh Mohanty +3
Computer Science · #Cloud Computing and Resource Management #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Operating Systems (cs.OS) #Parallel Computing and Optimization Techniques

paper · pdf · doi:10.48550/arxiv.1103.3831

openalex publication_date 2011/03/20 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum, so that context switching can be reduced. In this paper, we have proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum with Readjusted Round Robin (DQRRR) algorithm. We have experimentally shown that performance of DQRRR is better than RR by reducing number of context switching, average waiting time and average turn around time.

Related

• Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time
• Enhancing CPU Performance using Subcontrary Mean Dynamic Round Robin (SMDRR) Scheduling Algorithm
• Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm
• An Effective Round Robin Algorithm using Min-Max Dispersion Measure
• Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum