Skip to main content
SpringerLink
Log in

Cyclic Scheduling Algorithm

  • Conference paper
  • First Online:
Emerging Research in Computing, Information, Communication and Applications

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

Abstract

CPU Scheduling has played a critical role in making efficient systems, It is the mechanism which allows one process to use the CPU for execution while other processes are put on hold because of unavailability of any required resource, with the aim of maximizing the CPU utilization and reducing the waiting time and the turnaround time. This paper presents a new Scheduling Algorithm, which supports preemption, reduces the turnaround time and the waiting time. To show its effectiveness, its comparison is done with other traditional scheduling algorithms including First Come First Serve, Shortest Job First, and Round Robin Scheduling Algorithm, and as a result it was found that the proposed algorithm provides a new and effective scheduling approach which reduces the average waiting time and average turnaround time in a much better way than the traditional approaches.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Similar content being viewed by others

References

  1. Silberschatz, A., & Gagne, G. Operating system concepts (8th ed.). WILEY.

    Google Scholar 

  2. Mittal, N., Garg, K., & Ashish America (2005). A paper on modified round robin algorithm. IJLTEMAS, 4(X1). ISSN 2278–2540.

    Google Scholar 

  3. Seltzer, M., Chen, P., & Outerhout, J. (1990). Disk scheduling revisited in USENIX. In H. M. Shamim (ed.), Operating system, DCSA-2302.Winter technical conference.

    Google Scholar 

  4. Raman, & Mittal, P. K. (2014). An efficient dynamic round robin CPU scheduling algorithm. IJARCSSE.ISBN: 2277 128X.

    Google Scholar 

  5. Tong, W., & Zhao, J. (2007). Quantum varying deficit round robin scheduling over priority queues. In International Conference on Computational Intelligence and Security (pp. 252–256). China.

    Google Scholar 

  6. Kumar, M. R., & Renuka Rajendra, B. (2014). Prediction of length of the next CPU burst in SJF scheduling algorithm using dual simplex method. In 2nd International Conference on current Trends in Engineering and Technology ICCTET.

    Google Scholar 

  7. Khan, R., & Kakhani, G. (2015). Analysis of priority scheduling algorithm on the basis of fcfs and sjf for similar priority jobs. International Journal of Computer Science and Mobile Computing, 4, 324–331.

    Google Scholar 

  8. Li, J., Ma, T., Tang, M., Shen, W., & Jin, Y. (2017). Improved FIFO scheduling algorithm based on fuzzy clustering in cloud computing. Information, 8(1), 25.

    Article  Google Scholar 

  9. Indusree, J. R., & Prabadevi, B. (2017). Enhanced round robin CPU scheduling with burst time based time quantum. In IOP Conference Series: Materials Science and Engineering (Vol. 263, No. 4, p. 042038). IOP Publishing.

    Google Scholar 

  10. Singh, J., & Gupta, D. (2017). an smarter multi queue job scheduling policy for cloud computing. International Journal of Applied Engineering Research, 12(9), 1929–1934.

    Google Scholar 

  11. Lin, Z., & Huang, H. (2017). Research on weighted rotation fair scheduling algorithm based on hama parallel computing framework. DEStech Transactions on Engineering and Technology Research apop.

    Google Scholar 

  12. Jha, H., Chowdhury, S., & Ramya, G. (2017). Survey on various scheduling algorithms. Imperial Journal of Interdisciplinary Research, 3(5).

    Google Scholar 

  13. Peng, R., & Ding, L. (2017). Research on virtual network load balancing based on OpenFlow. In AIP Conference Proceedings (Vol. 1864, No. 1, p. 020014). AIP Publishing.

    Google Scholar 

  14. Chaturvedi, P., & Sharma, S. (2017). An provision for workflow scheduling using round robin algorithm in cloud. International Journal of Advanced Research in Computer Science, 8(5), 667–673.

    Google Scholar 

  15. Rao, G. S. N., Srinivasu, N., Srinivasu, S. V. N., & Rao, G. R. K. (2015). Dynamic time slice calculation for round robin process scheduling using NOC. International Journal of Electrical and Computer Engineering, 5(6), 1480–1485.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Meerut Institute of Engineering and Technology, Meerut, 250005, Uttar Pradesh, India

    Ravin Kumar

Authors
  1. Ravin Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravin Kumar .

Editor information

Editors and Affiliations

  1. Chancellor, Central University of Karnataka, Kalaburagi, Karnataka, India

    N. R. Shetty

  2. INSA Senior Scientist, National Institute of Advanced Studies,, Bangalore, Karnataka, India

    L. M. Patnaik

  3. Principal, Nitte Meenakshi Institute of Technology, Bangalore, Karnataka, India

    H. C. Nagaraj

  4. Professor, Nitte Meenakshi Inst of Tech, Bangalore, Karnataka, India

    Prasad Naik Hamsavath

  5. Professor, Nitte Meenakshi Institute of Technology, Bangalore, Karnataka, India

    N. Nalini

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumar, R. (2019). Cyclic Scheduling Algorithm. In: Shetty, N., Patnaik, L., Nagaraj, H., Hamsavath, P., Nalini, N. (eds) Emerging Research in Computing, Information, Communication and Applications. Advances in Intelligent Systems and Computing, vol 882. Springer, Singapore. https://doi.org/10.1007/978-981-13-5953-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-5953-8_38

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-5952-1

  • Online ISBN: 978-981-13-5953-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation