International Journal of
Computer Sciences and Engineering

Scholarly Peer-Reviewed, and Fully Refereed Scientific Research Journal

Flash News 

Wish you all very Happy Deepawali and Prosperous New Year. Authors are cordially invited to submit papers for the upcoming edition through online submission system

Design and performance evaluation of Advanced Priority Based Dynamic Round Robin Scheduling Algorithm (APBDRR)
Design and performance evaluation of Advanced Priority Based Dynamic Round Robin Scheduling Algorithm (APBDRR)
Author's : Debasmita Saha, Ardhendu Mandal
Section : Research Paper Page No : 78-84
Product Type : Conference Paper Volume-04 , Special Issue-01
    PDF Download  
Abstract :
In this paper we have proposed a improvised version of Round Robin Scheduling Algorithm by calculating Dynamic Time Quantum (DTQ) and taking into consideration the priorities assigned with the processes. We have compared the performance of the proposed Advanced Priority Based Dynamic Round Robin Scheduling Algorithm (APBDRR) with the performances of Round Robin Algorithm (RR), Improved Shortest Remaining Burst Round Robin Algorithm (ISRBRR) and Efficient Dynamic Round Robin Algorithm (EDRR). Experimental results show that the proposed algorithm performs better than these algorithms in terms of Average Waiting Time(AWT) and Average Turnaround Time(ATAT).
Key-Words / Index Term :
CPU Scheduling; Round Robin Scheduling; Priority Scheduling; Waiting Time; Turnaround Time; Time Quantum; Priority, Advanced Priority Based Dynamic Round Robin Scheduling Algorithm
Citation
Debasmita Saha, Ardhendu Mandal , "Design and performance evaluation of Advanced Priority Based Dynamic Round Robin Scheduling Algorithm (APBDRR)", International Journal of Computer Sciences and Engineering, Vol.04, Issue.01, pp.78-84, 2016.
References :
[1]. Sanjay Kumar Panda and Saurav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max Dispersion Measure”, International Journal on Computer Science and Engineering, 4(1), pp. 45-53, January 2012.
[2]. Pallab Banerjee, Probal Banerjee, Shweta Sonali Dhal, “Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using Static Time Quanmtum”, International Journal of Innovative Technology and Exploring Engineering, 1(3), pp. 56-62, August 2012.
[3]. P.Surendra Varma, “A Finest Time Quantum for Improving Shortest Remaining Burst Round Robin (SRBRR) Algorithm”, Journal of Global Research in Computer Science, 4 (3), pp. 10-15, March 2013.
[4].
[5]. Raman, Dr.Pradeep Kumar Mittal, “An Efficient Dynamic Round Robin CPU Scheduling Algorithm (EDRR)”, International Journal of Advanced Research in Computer Science and Software Engineering, 4(5), pp. 907-910, May 2014.
[6]. Silberschatz, A., P.B. Galvin and G. Gagne, Operating Systems Concepts. 7th Edn., John Wiley and Sons, USA., ISBN: 13: 978-0471694663, pp. 944.
[7]. Rakesh Mohanty, H. S. Behera, Khusbu Patwari, Monisha Dash, “Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm”, Proc. of International Symposium on Computer Engineering & Technology 2010, Vol 17, pp. 126-137, 2010 .
[8]. R. J. Matarneh, “Seif-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Proceses”, American Journal of Applied Sciences, 6(10), pp. 1831-1837, 2009.
[9]. H. S. Behera, R. Mohanty, and D. Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis”, International Journal of Computer Applications, 5(5), pp. 10-15, August 2010.