IMPROVED ROUND ROBIN POLICY A MATHEMATICAL APPROACH
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
This work attempts to mathematically formulize the computation of waiting time of any process in a static -process, CPU-bound round robin scheme. That in effect, can calculate other performance measures also. An improvement in the existing round robin algorithm has also been worked out that provides priority to processes nearing completion. The suggested approach uses two ready queues, wherein a rocess is returned to the second ready queue after the completion of its penultimate round. This policy reduces the average waiting time and increases the throughput, in omparison to the onventional round robin scheme, while maintaining the same level of CPU utilization and no ubstantial increase in the overheads. The mathematical ormulation of this policy is ransparent enough; it provides, for each process, the actual order of shifting to the second queue and also the order of ermination.
Authors and Affiliations
D. Pandey , Vandana
Keywords
Related Articles
- EP ID EP150195
- DOI -
- Views 158
- Downloads 0
Overview Of Various Overlapping Community Detection Approaches
With the advancement in technology, we are surrounded with huge amount of data, which need to be processed in some manner for further processing. For this purpose, we may combine the Data Mining Techniques with the conce...
Context Aware E-Learning System with Dynamically Composable Learning Objects
Context aware E-Learning systems provide learning content according to a learner’s context. In the existing context aware E-Learning systems there is no standardized set of context parameters considered and content is ad...
MLIP: A Concurrent Approach for Clipping Indexing
Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-...
A Comparative Study of Google and Bing Search Engines in Context of Precision and Relative Recall Parameter
This paper compared the retrieval effectiveness in context of precision and relative recall of Google and Bing search engine for evaluating the effectiveness of both search engine. The queries used are related to general...
A Survey on the Applications of Bee Colony Optimization Techniques
In this paper an overview of the areas where the Bee Colony Optimization (BCO) and its variants are applied have been given. Bee System was identified by Sato and Hagiwara in 1997 and the Bee Colony Optimization (BCO) wa...