Abstract

CPU scheduling is one of the most primary and essential part of any operating system. It prioritizes processes to efficiently execute the user requests and help in choosing the appropriate process for execution. Round Robin (RR) & Priority Scheduling(PS) are one of the most widely used and acceptable CPU scheduling algorithm. But, its performance degrades with respect to turnaround time, waiting time & context switching with each recurrence. A New scheduling algorithm OMDRRS is developed to improve the performance of RR and priority scheduling algorithms. The new algorithm performs better than the popular existing algorithm. Drastic improvement is seen in waiting time, turnaround time, response time and context switching. Comparative analysis of Turn around Time(TAT), Waiting Time(WT), Response Time (RT) is shown with the help of ANOVA and t-test.

Highlights

  • CPU scheduling is similar to other types of scheduling, which have been studied over the years

  • The results of all algorithms are compared for the scheduling criteria like turnaround time, waiting time, response time and context switch etc

  • The OMDRRS algorithm would be maintaining all jobs based on the factor analysis that is ready for execution in a queue

Read more

Summary

INTRODUCTION

CPU scheduling is similar to other types of scheduling, which have been studied over the years. CPU scheduling refers to the decision of allocating a single resource among multiple clients. It tracks the order of allocation and duration. Optimization system is considered as most de¬emed criteria by the system designers [1]. To understand and comprehend them in detail, they need to be simulated and performance indices must be studied. This paper depicts the usability of different scheduling algorithms, compare them on the basis of different performance criteria and introduce a newly designed improvised RR scheduling algorithm(OMDRRS). The results of all algorithms are compared for the scheduling criteria like turnaround time, waiting time, response time and context switch etc

Scheduling Criteria
Organization of the Paper
Hypothesis of Study
Simulator
Proposed Algorithm
Time Complexity of OMDRRS Algorithm
Logic Diagram of OMDRRS Algorithm
Experimental Analysis
Results of Analysis
CONCLUSION AND FUTURE SCOPE
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call