Call For Paper Volume:4 Issue:6 Jun'2017

Comparision of different Round Robin Scheduling Algorithm using Dynamic Time Quantum

Publication Date : 30/11/2014



Author(s) :

Viral D Sanghvi , Jignesh N Solanki.


Volume/Issue :
Volume 1
,
Issue 5
(11 - 2014)



Abstract :

Performance of computer system is heavily depends on the scheduling of the processes. The concept of scheduling helps in selection of the process for execution. There are many scheduling techniques available like First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (RR) etc. Output of these scheduling technique is depends on mainly three parameter, one is average waiting time, average turnaround time and number of context switch. It also depends on the context switching of the processes. In this paper, we focus on the RR scheduling techniques. There are two types of RR scheduling technique, one is RR with static quantum and other is RR with dynamic quantum. In this paper we compare the result of different RR algorithm techniques those having dynamic quantum and we show that even-odd RR scheduling is the best scheduling technique compare to simple RR, average-max RR and average mid-max RR.


No. of Downloads :

23


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

Comparision of different Round Robin Scheduling Algorithm using Dynamic Time Quantum

December 4, 2014