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 146
- Downloads 0
Experimenting with Request Assignment Simulator (RAS)
There is no existence of dedicated simulators on the Internet that studies the impact of load balancing principles of the cloud architectures. Request Assignment Simulator (RAS) is a customizable, visual tool that helps...
A Classification Technique for Microarray Gene Expression Data using PSO-FLANN
Despite of an increased global effort to end breast cancer, it continues to be most common cancer deaths in women. This problem reminds that new therapeutic approaches are desperately needed to improve patient survival r...
Integration of Web mining and web crawler: Relevance and State of Art
This study presents the role of web crawler in web mining environment. As the growth of the World Wide Web exceeded all expectations,the research on Web mining is growing more and more.web mining research topic which com...
Output Regulation of the Tigan System
This paper solves the problem of regulating the output of the Tigan system (2008), which is one of the recently discovered three-dimensional chaotic attractors. Tigan system has many interesting complex dynamical behavio...
DESIGN OF PARAMETER EXTRACTOR IN LOW POWER PRECOMPUTATION BASED CONTENT ADDRESSABLE MEMORY
Content-addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due to its ability to improve application per...