An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

  • Authors

    • Govind Prasad Arya
    • Kumar Nilay
    • Devendra Prasad
    https://doi.org/10.14419/ijet.v7i4.5.20077

    Received date: September 22, 2018

    Accepted date: September 22, 2018

    Published date: September 22, 2018

  • CPU Scheduling, Round Robin Scheduling, Priority Scheduling, Waiting Time, Turnaround Time, Time Quantum

  • Abstract

    The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes.

  • References

    1. Sanjay Kumar Panda and Saurav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max Dispersion Measure”, In-ternational Journal on Computer Science and Engineering, 4(1), pp. 45-53, January 2012.
    2. Pallab Banerjee, Probal Banerjee, Shweta Sonali Dhal, “Compara-tive Performance Analysis of Average Max Round Robin Schedul-ing Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm usingStatic Time Quanmtum”, Inter-national Journal of Innovative Technology and Exploring Engineer-ing, 1(3), pp. 56-62,August 2012.
    3. P.Surendra Varma, “A Finest Time Quantum for Improving Short-est Remaining Burst Round Robin (SRBRR) Algorithm”, Journal of Global Research in Computer Science, 4 (3), pp. 10-15, March 2013.
    4. Raman, Dr.Pradeep Kumar Mittal, “An Efficient Dynamic Round Robin CPU Scheduling Algorithm (EDRR)”, International Journal of Advanced Research in Computer Science and Software Engi-neering, 4(5), pp. 907-910, May 2014.
    5. Silberschatz, A., P.B. Galvin and G. Gagne, Operating Systems Concepts. 7th Edn., John Wiley and Sons, USA., ISBN:13: 978-0471694663, pp. 944.
    6. 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 .
    7. R. J. Matarneh, “Seif-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Proces-es”, American Journal of Applied Sciences, 6(10), pp. 1831-1837, 2009.
    8. H. S. Behera, R. Mohanty, and D. Nayak, “A New Proposed Dy-namic Quantum with Re-Adjusted Round Robin Scheduling Algo-rithm and Its Performance Analysis”, International Journal of Com-puter Applications, 5(5), pp. 10-15, August 2010.
    9. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”, Sixth Edition.
    10. E.O. Oyetunji, A. E. Oluleye,” Performance Assessment of Some CPU Scheduling Algorithms”, Research Journal of Information Technology,1(1): pp 22-26, 2009
    11. Ajit Singh, Priyanka Goyal, Sahil Batra,” An Optimized Round Robin Scheduling Algorithm for CPU Scheduling”, (IJCSE) Inter-national Journal on Computer Science and Engineering Vol. 02, No. 07, 2383-2385, 2010.
    12. Rami J. Matarneh.“Self-Adjustment Time Quantum in Round Rob-in Algorithm Depending on Burst Time of Now Running Process-es”, American J. of Applied Sciences 6(10):1831-1837, 2009.
    13. Sourav Kumar Bhoi, Sanjaya Kumar Panda, Debashee Tarai, “En-hancing cpu performance using subcontrary mean dynamic round robin (smdrr) scheduling algorithm” ,JGRCS, Volume 2, No. 12, December 2011, pp.17-21
    14. 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”, International Symposium on Computer Engineering & Technology (ISCET), Vol 17, 2010
    15. P.Surendra Varma , “A FINEST TIME QUANTUM FOR IM-PROVING SHORTEST REMAINING BURST ROUND ROBIN (SRBRR) ALGORITHM” Journal of Global Research in Computer Science, 4 (3), March 2013, 10-15
    16. Rakesh Kumar Yadav, Abhishek K Mishra, Navin Prakash, Himanshu Sharma,” An Improved Round Robin Scheduling Algo-rithm for CPU Scheduling”, (IJCSE) International Journal on Com-puter Science and Engineering Vol. 02, No. 04, 1064-1066, 2010
    17. Ishwari Singh Rajput,” A Priority based Round Robin CPU Sched-uling Algorithm for Real Time Systems”, (IJIET)International Jour-nal of Innovations in Engineering and Technology Vol. 1 Issue 3 Oct 2012
    18. Manish Kumar Mishra & Abdul Kadir Khan, (2012) “An Improved Round Robin CPU Scheduling Algorithm”, Journal of Global Re-search in Computer Science, Vol. 3, No. 6, pp 64-69.
    19. Abdulrazak Abdulrahim, Salisu Aliyu, Ahmad M Mustapha & Saleh E. Abdullahi, (2014) “An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm”, International Journal of Advanced Research in Computer Science and Software Engi-neering, Vol. 4, Issue 2, pp 601-610.
    20. Abdulrazak Abdulrahim, Saleh E. Abdullahi & Junaidu B. Sahalu, (2014) “A New Improved Round Robin (NIRR) CPU Scheduling Algorithm”, International Journal of Computer Applications, Vol. 90, No. 4, pp 27-33.
    21. An Effective Round Robin Algorithm using Min-Max Dispersion Measure. Panda, Sanjaya Kumar; Bhoi, Sourav Ku-mar // International Journal on Computer Science & Engineer-ing;Jan2012, Vol. 4 Issue 1, p45
    22. Designing Various CPU Scheduling Techniques using SCIL-AB. Saini, Mona // International Journal of Computer Science & In-formation Technolo;2014, Vol. 5 Issue 3, p2918
    23. Self-Adjustment Time Quantum in Round Robin Algorithm De-pending on Burst Time of the Now Running Processes. Matarneh, Rami J. // American Journal of Applied Sciences;2009, Vol. 6 Issue 10, p1831
    24. Two Queue based Round Robin Scheduling Algorithm for CPU Scheduling. Jindal, Srishty; Grover, Priyanka // International Journal of Computer Applications;Nov2014, Vol. 105 Issue 1-18, p21
    25. A 2LFQ Scheduling with Dynamic Time Quantum using Mean Av-erage. Lenka, Rakesh K.; Ranjan, Prabhat // International Journal of Computer Applications;6/1/2012, Vol. 47, p15
    26. Improvised Round Robin (CPU) Scheduling Algorithm. Sirohi, Abhishek; Pratap, Aseem; Aggarwal, Mayank // International Jour-nal of Computer Applications;Aug2014, Vol. 99, p40
    27. A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average. Noon, Ab-bas; Kalakech, Ali; Kadry, Seifedine // International Journal of Computer Science Issues (IJCSI);May2011, Vol. 8 Issue 3, p224

  • Downloads

  • How to Cite

    Prasad Arya, G., Nilay, K., & Prasad, D. (2018). An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process. International Journal of Engineering and Technology, 7(4.5), 238-241. https://doi.org/10.14419/ijet.v7i4.5.20077