Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm

Authors

  • Banerjee A Assistant Professor Kalyani Govt Engg. College
  • Mondal N Student, Dept. of Computer Applications Kalyani Govt Engg. College
  • Naznin Student, Dept. of Computer Applications Kalyani Govt Engg. College
  • Basu P Student, Dept. of Computer Applications Kalyani Govt Engg. College
  • Singh P Student, Dept. of Computer Applications Kalyani Govt Engg. College

Keywords:

CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight

Abstract

CPU is a primary computer resource, so its scheduling is central to operating system design. When multiple runnable processes exist in the ready queue, OS has the onus of responsibility to decide which one is to run fast. The part of the OS that takes this decision is called scheduler and the algorithm based on which it works, is called the scheduling algorithm. Different kinds of scheduling algorithms exist in the literature. Among them First-Come-First-Served (FCFS), Shortest-job-first (SJF), Priority Scheduling and Round-robin, are mention-worthy. This paper proposes a weight-based starvation-free improvised scheduling algorithm that allocates CPU to processes in round-robin manner while the time quantum is calculated based on the burst time of the processes waiting in the ready queue.

References

. http://en.wikipedia.org/wiki/Scheduling_(computing)

. Sindhu M, Rajkamal R, Vigneshwaran P. An Optimum Multilevel CPU Scheduling Algorithm.2010 International Conference on Advances in Computer Engineering

. Wei Zhao, John A. Stankovic. Performance Analysis of FCFSand Improved FCFS Scheduling Algorithms for DynamicReal-Time Computer Systems.IEEE 1989.

. DavenderBabbar, Phillip Krueger. A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors.IEEE 1994.

. Umar Saleem and Muhammad YounusJaved. Simulation Of CPU Scheduling Algorithms. IEEE 2000.

. SnehalKamalapur, Neeta Deshpande. Efficient CPU Scheduling: A Genetic Algorithm based Approach. IEEE 2006.

. Nikolaos D. Doulamis, Anastasios D. Doulamis, Emmanouel A. Varvarigos, and Theodora A. Varvarigou. Fair Scheduling Algorithms in Grids. IEEE Transactions On Parallel And Distributed Systems, Vol. 18, No. 11, November 2007

. Xiao-jing Zhu, Hong-boZeng, Kun Huang, Ge Zhang. Round-robin based scheduling algorithms for FIFO IQ switch. IEEE 2008.

. Apurva Shah, KetanKotecha. Efficient Scheduling Algorithms for Real-Time Distributed Systems. 2010 1st International Conference on Parallel, Distributed and Grid Computing

. DevendraThakor, Apurva Shah. D_EDF: An efficient Scheduling Algorithm for Real-Time Multiprocessor System.IEEE 2011.

. Tong Li, Dan Baumberger, Scott Hahn. Efficient and Scalable Multiprocessor Fair Scheduling Using Distributed Weighted Round-Robin. ACM 2009

. A. Sirohi, A. Pratap, M. Aggarwal, Improvised Round-Robin CPU Scheduling Algorithm, International Journal of Computer Applications, vol. 99, no. 18, August 2014

Downloads

Published

2025-11-11

How to Cite

[1]
A. Banerjee, N. Mondal, Naznin, P. Basu, and P. Singh, “Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm”, Int. J. Comp. Sci. Eng., vol. 4, no. 1, pp. 69–77, Nov. 2025.

Issue

Vol. 4 No. 1 (2016): IJCSE Special Issue February Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.