Open Access   Article Go Back

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

CPU 1 , Processes 2 , Ready Queue3 , Round-Robin 4 , Scheduling 5 , Weight 6

Section:Research Paper, Product Type: Conference Paper
Volume-04 , Issue-01 , Page no. 69-77, Feb-2016

Online published on Feb 26, 2016

Copyright © CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight, “Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm,” International Journal of Computer Sciences and Engineering, Vol.04, Issue.01, pp.69-77, 2016.

MLA Style Citation: CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight "Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm." International Journal of Computer Sciences and Engineering 04.01 (2016): 69-77.

APA Style Citation: CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight, (2016). Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm. International Journal of Computer Sciences and Engineering, 04(01), 69-77.

BibTex Style Citation:
@article{Queue_2016,
author = {CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight},
title = {Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2016},
volume = {04},
Issue = {01},
month = {2},
year = {2016},
issn = {2347-2693},
pages = {69-77},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=35},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=35
TI - Weight-based Starvation-free Improvised Round-Robin (WSIRR) CPU Scheduling Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - CPU, Processes, Ready Queue, Round-Robin, Scheduling, Weight
PY - 2016
DA - 2016/02/26
PB - IJCSE, Indore, INDIA
SP - 69-77
IS - 01
VL - 04
SN - 2347-2693
ER -

           

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.

Key-Words / Index Term

Anuradha Banerjee, Nabajit Mondal, Naznin, Poulomi Basu, Prateeksha Singh

References

[1]. http://en.wikipedia.org/wiki/Scheduling_(computing)
[2]. Sindhu M, Rajkamal R, Vigneshwaran P. An Optimum Multilevel CPU Scheduling Algorithm.2010 International Conference on Advances in Computer Engineering
[3]. Wei Zhao, John A. Stankovic. Performance Analysis of FCFSand Improved FCFS Scheduling Algorithms for DynamicReal-Time Computer Systems.IEEE 1989.
[4]. DavenderBabbar, Phillip Krueger. A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors.IEEE 1994.
[5]. Umar Saleem and Muhammad YounusJaved. Simulation Of CPU Scheduling Algorithms. IEEE 2000.
[6]. SnehalKamalapur, Neeta Deshpande. Efficient CPU Scheduling: A Genetic Algorithm based Approach. IEEE 2006.
[7]. 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
[8]. Xiao-jing Zhu, Hong-boZeng, Kun Huang, Ge Zhang. Round-robin based scheduling algorithms for FIFO IQ switch. IEEE 2008.
[9]. Apurva Shah, KetanKotecha. Efficient Scheduling Algorithms for Real-Time Distributed Systems. 2010 1st International Conference on Parallel, Distributed and Grid Computing
[10]. DevendraThakor, Apurva Shah. D_EDF: An efficient Scheduling Algorithm for Real-Time Multiprocessor System.IEEE 2011.
[11]. Tong Li, Dan Baumberger, Scott Hahn. Efficient and Scalable Multiprocessor Fair Scheduling Using Distributed Weighted Round-Robin. ACM 2009
[12]. A. Sirohi, A. Pratap, M. Aggarwal, Improvised Round-Robin CPU Scheduling Algorithm, International Journal of Computer Applications, vol. 99, no. 18, August 2014