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 145
- Downloads 0
Architecture for efficiently streaming stored video using TCP
Abstract : TCP (Transmission Control Protocol) with its wellestablished congestion control mechanism is the prevailing transport layer protocol for non-real time data in current IP (Internet Protocol) networks. It would...
Security issues occur in Cloud Computing and there Solutions
Cloud computing is a recent advancement wherein IT infrastructure and applications are provided as “services” to end-users under a usage-based payment model. Many organizations, such as Google, Amazon, IBM and many other...
Protection of Public Network Communication by using Internet Protocol Security
This paper deals with the issue of the protection of public etwork c description of custom cipher algorithm mplementation method is given. Paper also contains xperiment description with results. In the existing...
Improved Self Fused Check pointing Replication for Handling Multiple Faults in Cloud Computing
The performance of checkpointing replication fault tolerance technique is severely bottlenecks due to handling of number of replicas generated for a large number of nodes to tolerate multiple faults such as multiple fail...
Enhancement of Split Multipath Routing Protocol in MANET
In the MANET, routing protocols are used to provide the specific path for sending the data packets. Multipath routing provides the multiple paths in the MANET. So, in this paper we enhance the performance of Split Multip...