An Improved Dynamic Round Robin CPU Scheduling Algorithm Using SJF Technique
Journal Title: International Journal of Innovative Research in Computer Science and Technology - Year 2015, Vol 3, Issue 3
Abstract
CPU Scheduling is one of the fundamental concepts of operating system. There exists a number of CPU scheduling algorithms like first come f irst serve, shortest job first scheduling, round robin scheduling, priority scheduling etc. In these algorithms the round robin CPU scheduling is the preferred choice in time shared systems but it is not suitable for Real time systems ,because the existing RR CPU scheduling depends on the choice of static time quantum that decreases the performance of CPU and also have more number of context switches and longer waiting and response time.This in turn leads to low throughput of the system. In a real time systems the process having relatively larger CPU burst time it will leads to the problem of starvation.In this paper we have proposed a new algorithm that gives better CPU performance using the features of shortest job first and round robin scheduling with dynamic time quantum. This algorithm reduces the average waiting time, average turnaround time and number of context switches and also it gives high throughput. The proposed algorithm improves all the disadvantages of simple RR CPU Scheduling algorithm.
Authors and Affiliations
Sri Lakshmi . K, Korupala Venkataramani, Sindhe Swetha
Keywords
Related Articles
- EP ID EP748805
- DOI -
- Views 22
- Downloads 0
Learning Assistant in Educational Field Using Automatic Speech Recognition
Automatic Speech recognition is the translation of spoken words into text. It takes speech data as input and divides it into small time domain frames. Speech signal processing considering speech signals stationary for a...
Derivation of Kinetic Equations for Free-Radical Nonbranched-Chain Processes of Hydrocarbon and Hydrogen Oxidation
The derivation of kinetic equations for the oxidation processes by the free-radical nonbranched-chain mechanism is shown. This derivation is based on the proposed reaction scheme for the initiated addition of free radica...
The Variational Methods for Solving Random Models
This paper studies the solutions of variational methods for random ordinary (partial) dierential equations in L2−space. These methods are called Galerkin method, Petrov-Galerkin method, Least-Squares method and Collocati...
An Enriched Information Security Framework from Various Attacks in the IoT
Security in various E-commerce Applications includes an efficient framework in Information Security especially in Computer Security, Data Security and other online transactions in E-commerce applications. Security in E-C...
Factor to Facilitate Learning in Knowledge Sharing
Knowledgesharing is fundamentally about making the right knowledge or the right knowledge sources (including people) available to the right people at the right time. Knowledge sharing is therefore perhaps the single most...