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
Evaluating Qualitative Measures for Effective Website Design
The primary goal of this paper is to investigate and evaluate qualitative measures for improving the website design of various universities in India. The website of each university is scanned using W3C guidelines. The pa...
Restoration of Normal Frequency Affected by Small Load Variations Through HVDC Link Using Neuro-Fuzzy Approach
HVDC power transmission is coming up with merits to replace the EHV-AC systems. The controller inverter operation can successfully regulate the power in HVDC link leading to fulfillment of power demand in A.C. networks c...
Cluster Based Message Dissemination for Broadcasting the Emergency/Warning Messages using a Novel Scheduling in VANETS
Vehicular ad hoc networks are a special case of mobile ad hoc networks (MANETs). Unlike MANETs, VANET nodes are moving very fast. It becomes quite challenging to maintain a stable path for broadcasting Emergency and Warn...
Entropy Based Lossless Fractal Image Compression using Irregular Rectangular Partitions
Entropy of an image can be taken as a parameter of variation among pixel values. Equal value for all pixels in an image results in zero entropy. This idea is incorporated at the time of partitioning the image. Partitions...
A SURVEY OF CALL MARKET (DISCRETE) AGENT BASED ARTIFICIAL STOCK MARKETS
Artificial stock markets are models of financial markets used to study and understand market dynamics. Agent Based Artificial Stock Markets can be seen as any market model in which prices are formed endogenously as a res...