Skip to main content
SpringerLink
Log in
Book cover

Information Systems Design and Intelligent Applications pp 457–467Cite as

Optimization in Round Robin Process Scheduling Algorithm

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 434))

Abstract

Round Robin (RR) scheduling algorithm certainly is one of the most popular algorithms. In this algorithm, a static time quantum is given to each process. However it suffers from certain problems which are mainly related to the size of time quantum. Larger the time quantum, larger is the response and waiting time of processes. Similarly if the time quantum is too small then the overhead of CPU increases because CPU has to perform greater number of context switches. This paper focuses on the optimization techniques in Round Robin algorithm. Several algorithms have been proposed which use a dynamic time quantum, rather than a static one. The concept of mean, median, dispersion and others are used to calculate time quantum for processes in ready queue based on their remaining burst time. An approach based on multiple time quanta has also been proposed in this paper. Finally it has been shown through implementation and results that these algorithms are able to solve the problems of conventional Round Robin algorithm. A better turnaround time, response time and waiting time has been achieved through the implementation of these algorithms.

This is a preview of subscription content, log in via an institution.

References

  1. Stallings, W: Operating Systems, Internals and Design Principles. Prentice Hall, Englewood Cliffs (2001).

    Google Scholar 

  2. Silberschatz, Galvin and Gagne: Operating systems concepts, 9th edition, Wiley, (2012).

    Google Scholar 

  3. Andrew Tanenbaum, “Modern operating systems”, 3rd edition, Pearson education international, (2007).

    Google Scholar 

  4. Samih M. Mostafa, S. Z. Rida and Safwat H. Hamad, “Finding Time Quantum Of Round Robin Cpu Scheduling Algorithm In General Computing Systems Using Integer Programming”, International Journal of Research and Reviews in Applied Sciences (IJRRAS), Vol 5, Issue 1, (2010).

    Google Scholar 

  5. D Praveen Kumar, T. Sreenivasula Reddy, A. Yugandhar Reddy, “Finding Best Time Quantum for Round Robin Scheduling Algorithm to avoid Frequent Context Switch”, International Journal of Computer Science and Information Technologies, Vol. 5 (5), (2014).

    Google Scholar 

  6. Mahesh Kumar M R, Renuka Rajendra B and Sreenatha M, Niranjan C K, “An Improved approach to minimize context switching in rounr orbin scheduling algorithm using optimization techniques”, International Journal of Research in Engineering and Technology Volume: 03 Issue: 04, (2014).

    Google Scholar 

  7. Shahram Saeidi and Hakimeh Alemi Baktash, “Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method”, I.J. Information Technology and Computer Science, (2012).

    Google Scholar 

  8. Tarek Helmy and Abdelkader Dekdouk, “Burst Round Robin as a Proportional-Share Scheduling Algorithm”, In Proceedings of The fourth IEEE-GCC Conference on Towards Techno - Industrial Innovations, pp. 424-428, Bahrain, (2007).

    Google Scholar 

  9. Aashna Bisht, Mohd Abdul Ahad and Sielvie Sharma, “Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm”, International Journal of Computer Applications (0975 – 8887) Volume 98 – No. 21, July (2014).

    Google Scholar 

  10. Rakesh Mohanty, H. S. Behera and Debashree Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis”, International Journal of Computer Applications (0975–8887), Volume 5– No. 5, August (2010).

    Google Scholar 

  11. Bashir Alam, M. N. Doja and R. Biswas, “Finding Time Quantum of Round Robin CPU Scheduling Algorithm Using Fuzzy Logic,” International Conference on Computer and Electrical Engineering, (2008).

    Google Scholar 

  12. Ishwari Singh Rajput and Deepa Gupta, “A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems”, International Journal of Innovations in Engineering and Technology (IJIET) ISSN: 2319 – 1058 Vol. 1 Issue 3 Oct (2012).

    Google Scholar 

  13. Abbas Noon, Ali Kalakech and Seifedine Kadry, “A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average”, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May (2011).

    Google Scholar 

  14. Siregar, “A New Approach to CPU Scheduling Algorithm: Genetic Round Robin”, International Journal of Computer Applications, Vol. 47, No. 19, (2012).

    Google Scholar 

  15. Jeegar A Trivedi and Priti Srinivas Sajja, “Improving efficiency of round robin scheduling using neuro fuzzy approach”, IJRRCS vol. 2, No. 2, April (2011).

    Google Scholar 

  16. C. Yaashuwanth, R. Ramesh, (2010) “Intelligent Time Slice for Round Robin in Real Time Operating Systems”, IJRRAS, 2(2):126–131.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Delhi Technological University, Delhi, India

    Anurag Upadhyay & Hitesh Hasija

Authors
  1. Anurag Upadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hitesh Hasija
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anurag Upadhyay .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, India

    Suresh Chandra Satapathy

  2. Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  3. University of Hyderabad, Hyderabad, India

    Siba K. Udgata

  4. Department of Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Upadhyay, A., Hasija, H. (2016). Optimization in Round Robin Process Scheduling Algorithm. In: Satapathy, S.C., Mandal, J.K., Udgata, S.K., Bhateja, V. (eds) Information Systems Design and Intelligent Applications. Advances in Intelligent Systems and Computing, vol 434. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2752-6_45

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2752-6_45

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2750-2

  • Online ISBN: 978-81-322-2752-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation