Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm

2011/09/14 by Rakesh Mohanty, Mohanty, Rakesh, Manas Das +4
Computer Science · #Distributed systems and fault tolerance #Embedded Systems Design Techniques #FOS: Computer and information sciences #Operating Systems (cs.OS) #Real-Time Systems Scheduling

paper · pdf · doi:10.48550/arxiv.1109.3075

openalex publication_date 2011/09/14 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor f and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switches, average waiting time and average turnaround time.

Related

• Enhancing CPU Performance using Subcontrary Mean Dynamic Round Robin (SMDRR) Scheduling Algorithm
• A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis
• Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time
• A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme
• An Effective Round Robin Algorithm using Min-Max Dispersion Measure