COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME

Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 2

Abstract

CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the algorithm. Experimental analysis shows better performance of this improved algorithm over the Round Robin algorithm and the Shortest Remaining Burst Round Robin algorithm. It minimizes the overall number of context switches, average waiting time and average turn-around time. Consequently the throughput and CPU utilization is better.

Authors and Affiliations

H. S. Behera , Rakesh Mohanty , Sabyasachi Sahu , Sourav Kumar Bhoi

Keywords

Related Articles

GROUPING WEB ACCESS SEQUENCES USING SEQUENCE ALIGNMENT METHOD

In web usage mining grouping of web access sequences can be used to determine the behavior or intent of a set of users. Grouping web sessions is how to measure the similarity between web sessions. There are many shortcom...

TEST SUITE GENERATION PROCESS FOR AGENT TESTING

Software agents are a promising technology for today's complex, distributed systems. Methodologies and techniques that address testing and reliability of multi agent systems are increasingly demanded, in particular to su...

Word Sense Disambiguation using case based Approach with Minimal Features Set

In this paper we presented a case based approach for word sense disambiguation using minimal features set. To make the disambiguation, we took only two features for two different methods, post-bigram (immediate left word...

ARTIFICIAL NEURAL NETWORK BASED DISCRIMINATION OF MINELIKE OBJECTS IN INFRARED IMAGES

An artificial neural network (ANN) model with a simple architecture containing a single hidden layer is presented to discriminate the landmine objects from the acquired infrared images. The proposed method consists of pr...

An Optimized Secure Communication Using VLR-GS-BU on Wireless Network

A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. I...

Download PDF file
  • EP ID EP134623
  • DOI -
  • Views 123
  • Downloads 0

How To Cite

H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi (2011). COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME. Indian Journal of Computer Science and Engineering, 2(2), 262-271. https://europub.co.uk/articles/-A-134623