Computer Science – Operating Systems
Scientific paper
2011-05-09
International Journal of Advanced Computer Science and Applications(IJACSA), Vol. 2 No. 2, February 2011 2011, 46-50
Computer Science
Operating Systems
5 pages
Scientific paper
In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robin Algorithm(PBDRR),which calculates intelligent time slice for individual processes and changes after every round of execution. The proposed scheduling algorithm is developed by taking dynamic time quantum concept into account. Our experimental results show that our proposed algorithm performs better than algorithm in [8] in terms of reducing the number of context switches, average waiting time and average turnaround time.
Behera H. S.
Dash Monisha
Mohanty Rakesh
Patwari Khusbu
Prasanna Lakshmi M.
No associations
LandOfFree
Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-334534