Skip to main content

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 166))

Abstract

Developing CPU scheduling algorithms in operating system and understanding effect of various algorithms in practice can be difficult and deadly because of the requirement to update the operating system and test operating system kernel code and quantity the succeeding presentation of operating system on a consistent workload. As processor is the important resource, CPU scheduling turns out to be significant in fulfill the operating system (OS) design goals. The intention ought to be permitted whatever number as could reasonably be expected running processes or task at all the time in order to make best utilization of CPU. This paper includes a short comparisons and examination of numerous CPU scheduling algorithm by arranging estimations for a singular processor CPU and provide which algorithm is generally fitting for the particular condition. Utilizing this depiction, it turns out to be a lot more obvious what the effect is in the working context and why an different preparation of measures is a contender for the allotment of the CPU at numerous situation. The target of the investigation is to examine the exceptionally effective CPU scheduler for working framework.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Neetu Goel RBG (2015) A comparative study of CPU scheduling algorithms. IJGIP

    Google Scholar 

  2. Imran Qureshi (2014) CPU scheduling algorithms: a survey, (2014) Int J Adv Netw Appl. ISSN:0975-0290

    Google Scholar 

  3. Dhamdhere DM (2006) Operating systems a concept based approach. 2nd edn, Tata McGraw-Hill

    Google Scholar 

  4. Silberchatz G, Galvin G, Gagne PB (2003) Operating systems concepts

    Google Scholar 

  5. Neetu Goel RBG (2016) Performance analysis of CPU scheduling algorithms with novel OMDRRS algorithm. Int J Adv Comput Sci Appl (IJACSA)

    Google Scholar 

  6. Purnendra Kumar R (2017) Comparison of performance of RR CPU scheduling algorithm with different dynamic CPU scheduling algorithm. Int J Innov Res Sci Eng Technol (IJIRSET). ISSN(Online):2319–8753

    Google Scholar 

  7. Patel R, Patel M (2013) SJRR CPU scheduling algorithm. IJECS ISSN:2319–7242

    Google Scholar 

  8. Singh P, Singh V, Pandey A (2014) Analysis and comparison of CPU scheduling algorithms. Int J Emerg Technol Adv Eng (IJETAE). ISSN:2250-2459

    Google Scholar 

  9. Matarneh RJ (2009) Self-Adjustment time quantum in round robin algorithm depending on burst time of the now running processes. Am J Appl Sci 6(10):1831–1837

    Article  Google Scholar 

  10. Singh A, Goyal P, Batra S (2010) An optimized round robin scheduling algorithm for CPU scheduling. Int J Comput Sci Eng 02(07):2383–2385

    Google Scholar 

  11. Noon A, Kalakech A, Kadry S (2011) A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average. IJCSI Int J Comput Sci Issues 8(3):1

    Google Scholar 

  12. Mohanty R, Behera HS, Nayak D (2010) A new proposed dynamic quantum with re-adjusted round robin scheduling algorithm and its performance analysis. Int J Comput Appl (0975–8887) 5(5)

    Google Scholar 

  13. Nayak D, Malla SK, Debadarshini D (2012) Improved round robin scheduling using dynamic time quantum. Int J Comput Appl (1975–8875) 38(5)

    Google Scholar 

  14. Mohanty R, Behara HS, Tiwari K, Das M, Lakshmi Prasanna M (2011) Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time system. Int J Adv Comput Sci Appl 2(2)

    Google Scholar 

  15. Mohanty R, Behera HS, Patwari K, Dash M (2010) Design and performance evaluation of a new proposed shortest remaining burst round robin (SRBRR) scheduling algorithm. In: Proceedings of International Symposium on Computer Engineering & Technology (ISCET), vol 17

    Google Scholar 

  16. Behera HS et al (2011) A new dynamic round robin and SRTN algorithm with variable original time slice and intelligent time slice for soft real time systems. Int J Comput Appl 16(1):54–60

    MathSciNet  Google Scholar 

  17. Mohanty R, Das M, Lakshmi Prasanna M, Sudhashree (2011) Design and performance evaluation of a new proposed fittest job first dynamic round robin (FJFDRR) scheduling algorithm. International J Comput Inf Syst 2(2)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amit Kumar Gupta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Agrawal, P., Gupta, A.K., Mathur, P. (2021). CPU Scheduling in Operating System: A Review. In: Goyal, D., Gupta, A.K., Piuri, V., Ganzha, M., Paprzycki, M. (eds) Proceedings of the Second International Conference on Information Management and Machine Intelligence. Lecture Notes in Networks and Systems, vol 166. Springer, Singapore. https://doi.org/10.1007/978-981-15-9689-6_31

Download citation

Publish with us

Policies and ethics