International Journal of Mathematical Sciences and Computing (IJMSC)
IJMSC Vol. 6, No. 2, 8 Apr. 2020
Cover page and Table of Contents: PDF (size: 224KB)
Simulation of CPU Scheduling Algorithms using Poisson Distribution
Full Text (PDF, 224KB), PP.71-78
Views: 0 Downloads: 0
Author(s)
Index Terms
Poisson distribution, Shortest Job First Non-Preemptive, Dynamic Round-Robin even-odd number quantum Scheduling algorithm, Highest Response-Ratio-Next.
Abstract
Numerous scheduling algorithms have been developed and implemented in a bid to optimized CPU utilization. However, selecting a scheduling algorithm for real system is still very challenging as most of these algorithms have their peculiarities. In this paper, a comparative analysis of three CPU scheduling algorithms Shortest Job First Non-Preemptive, Dynamic Round-Robin even-odd number quantum Scheduling algorithm and Highest Response-Ratio-Next (HRRN) was carried out using dataset generated using Poisson Distribution. The performance of these algorithms was evaluated in the context of Average Waiting Time (AWT), Average Turnaround Time (ATT). Experimental results showed that Shortest Job First Non-Pre-emptive resulted in minimal AWT and ATT when compared with two other algorithms.
Cite This Paper
Amit Mishra, Abdullahi Ofujeh Ahmed, "Simulation of CPU Scheduling Algorithms using Poisson Distribution", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.6, No.2, pp.71-78, 2020. DOI: 10.5815/ijmsc.2020.02.04
Reference
[1] Muraleedharan, A., Antony, N., & Nandakumar, R. (2016). Dynamic time slice round robin scheduling algorithm with unknown burst time. Indian Journal of Science and Technology, 9(8).
[2] Simon, A., Abdullahi, S., & Junaidu, S. (2014). Dynamic Round Robin with Controlled Preemption (DRRCP). International Journal of Computer Science Issues (IJCSI), 11(3), 109.
[3] Goel, N., & Garg, R. B. (2013). A comparative study of cpu scheduling algorithms. arXiv preprint arXiv:1307.4165.
[4]Abur, M., Mohammed, A., Danjuma, S., & Abdullahi, S. (2011). A critical simulation of cpu scheduling algorithm using exponential distribution. IJCSI International Journal of Computer Science Issues, 8(6).
[5] Silberschatz A, Galvin P.B. and Gagne .G, 2009, Operating Systems Concepts, (7th ed), John Wiley & Sons, USA.
[6] Pallab Banerjee , Probal Banerjee , Shweta Sonali Dhal ,Comparative Performance Analysis of Even Odd Round Robin scheduling algorithm (EORR) using Dynamic Time Quantum with Round Robin scheduling algorithm using static Time Quantum , International Journal of Advanced Research in Computer Science and Software Engineering Volume 2, Issue 9, September 2012