An Effective Round Robin Algorithm using Min-Max Dispersion Measure
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 1
Abstract
Round Robin (RR) scheduling algorithm is a preemptive scheduling algorithm. It is designed especially for time sharing Operating System (OS). In RR scheduling algorithm the CPU switches between the processes when the static Time Quantum (TQ) expires. RR scheduling algorithm is considered as the most widely used scheduling algorithm in research because the TQ is equally shared among the processes. In this paper a newly proposed variant of RR algorithm called Min-Max Round Robin (MMRR) scheduling algorithm is presented. The idea of this MMRR is to make the TQ repeatedly adjusted using Min-Max dispersion measure in accordance with remaining CPU burst time. Our experimental analysis shows that MMRR performs much better than RR algorithm in terms of average turnaround time, average waiting time and number of context switches.
Authors and Affiliations
Sanjaya Kumar Panda , Sourav Kumar Bhoi
Keywords
Related Articles
- EP ID EP155754
- DOI -
- Views 116
- Downloads 0
Hybrid Neuro-Fuzzy Systems for Software Development Effort Estimation
The major prevailing challenges for Software Projects are Software Estimations like cost estimation, effort estimation, quality estimation and risk analysis. Though there are several algorithmic cost estimation models in...
Classifying Emotion in News Sentences: When Machine Classification Meets Human Classification
Multiple emotions are often evoked in readers in response to text stimuli like news article. In this paper, we present a method for classifying news sentences into multiple emotion categories. The corpus consists of 1000...
A study on the effectiveness of virtual lab in Elearning
The research aims to identify the effectiveness of virtual lab in E-learning suite. The study aims to analyze the increase in learning skills and the understanding level of concepts by implementing virtual lab among scho...
Performance Evaluation of Modified Signcryption Scheme
Before a message is sent out, the sender of the message would sign it using a digital signature scheme and then encrypt the message (and the signature) use a private key encryption algorithm under a randomly chosen messa...
NODE ADDRESSING SCHEMES FOR SCALABLE ROUTING IN HIERARCHICAL WSN
Wireless Sensor Network has a capacity of communication computation with node in a network. The sensor performs many significant tasks in a selective area. In this paper proposing the new idea to improve issues on node a...