CFP last date
20 June 2024
Reseach Article

Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor

by Muhammad A. Mustapha, Saleh E. Abdullahi, Sahalu B. Junaidu
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 132 - Number 11
Year of Publication: 2015
Authors: Muhammad A. Mustapha, Saleh E. Abdullahi, Sahalu B. Junaidu
10.5120/ijca2015907574

Muhammad A. Mustapha, Saleh E. Abdullahi, Sahalu B. Junaidu . Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor. International Journal of Computer Applications. 132, 11 ( December 2015), 24-32. DOI=10.5120/ijca2015907574

@article{ 10.5120/ijca2015907574,
author = { Muhammad A. Mustapha, Saleh E. Abdullahi, Sahalu B. Junaidu },
title = { Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 132 },
number = { 11 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 24-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume132/number11/23639-2015907574/ },
doi = { 10.5120/ijca2015907574 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:29:06.223393+05:30
%A Muhammad A. Mustapha
%A Saleh E. Abdullahi
%A Sahalu B. Junaidu
%T Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor
%J International Journal of Computer Applications
%@ 0975-8887
%V 132
%N 11
%P 24-32
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The priority based CPU scheduling algorithm (i.e. Shortest Job First (SJF) or Priority Scheduling (PS)) is a kind of scheduling algorithm that assigns the CPU to processes based on the priority of each process. The shortcoming of both of these algorithms is starvation (i.e. starvation of processes with longer burst times in the case of SJF and starvation of processes with lower priorities in the case of PS). This paper proposes a new algorithm that introduces the concept of EFFICIENCY FACTOR to all processes. This proposed algorithm was implemented and benchmarked against SJF, PS and the Optimum Service Time Concept for Round Robin Algorithm (OSTRR) by [9] using Uniform distribution to generate the burst times, Exponential distribution to generate the priorities and Poisson distribution to generate the arrival times of processes. It is observed that in the SJF category, the traditional SJF produced better Average Waiting Time (AWT), Average Turnaround Time (ATAT), Average Response Time (ART) and Waiting Time Variance Deviation (WTVD) compared with the proposed SJF. But they both produced the same Number of Context Switches (NCS). The proposed SJF produced better results compared with OSTRR with respect to AWT, ATAT, ART, NCS and WTVD. While in the PS category, the proposed priority produced better AWT, ATAT, ART and WTVD compared to the traditional Priority scheduling algorithm. But they both produced the same NCS. The proposed Priority algorithm produced better results compared with OSTRR with respect to NCS and WTVD also produced almost the same result in terms of AWT and ATAT in all categories of the statistical distributions used. Based on these results, the proposed priority algorithm should be preferred over the traditional priority algorithm.

References
  1. Brinch, H. P. (1977). The Architecture of Concurrent Programs. Englewood Cli®s, NJ: Prentice Hall.
  2. http://siber.cankaya.edu.tr/OperatingSystems/ceng328/node122.html. (n.d.). Retrieved May 25, 2014, from http://siber.cankaya.edu.tr.
  3. http://www.merriamwebster.com/dictionary/variance. (n.d.). Retrieved June 28, 2014, from http://www.merriam-webster.com.
  4. https://www.it.uu.se/edu/course/.../scheduling_algorithms/handout.pdf. (n.d.). Retrieved May 25, 2014, fromhttps://www.it.uu.se/edu/course/.../scheduling_algorithms/handout.pdf.
  5. Mehdi, N., Mehdi, S., Adel, N., And Ali, A. (2012). The New Method Of Adaptive Cpu Scheduling Using Fonseca And Fleming’s Genetic Algorithm. Journal Of Theoretical And Applied Information Technology , 1-16.
  6. Nong, Y., Xueping, L., Toni, F., and Xiaoyun, X. (2007). Job scheduling methods for reducing waiting time variance. Computers and Operations Research , 3069 - 3083.
  7. Oyetunji E.O and Oluleye A. E. (2009). Performance Assessment of Some CPU Scheduling Algorithms. Research Journal of Information Technology , 1 (1), 22-26.
  8. Rakesh, M, Manas, D, Lakshmi, M. P and Sudhashree. (2011). Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin (FJFDRR) Scheduling Algorithm. International Journal of Computer Information Systems , 2 (2), 23-27.
  9. Saxena, H. F., and Agarwal, P. S. (2012). Design and Performance Evaluation of Optimum Service Time Concept for Round Robin Algorithm. International Journal of Machine Learning and Computing , 2 (2), 113-117.
  10. Silberschatz, P. B. Galvin and G. Gagne. (2006). Operating System Concepts. (7th, Ed.) John Wiley and Sons Inc. 111 River Street, Hoboken NJ, 07030, 153-168
Index Terms

Computer Science
Information Sciences

Keywords

CPU scheduling algorithms Efficiency factor Shortest Job First Scheduling Starvation Priority Scheduling Waiting Time Variance Deviation