Simulation of CPU Scheduling Algorithms using Poisson Distribution | Zendy

Amit Mishra | Zendy; Abdullahi Ofujeh Ahmed | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Simulation of CPU Scheduling Algorithms using Poisson Distribution

Author(s) -

Amit Mishra,

Abdullahi Ofujeh Ahmed

Publication year - 2020

Publication title -

international journal of mathematical sciences and computing

Language(s) - English

Resource type - Journals

eISSN - 2310-9033

pISSN - 2310-9025

DOI - 10.5815/ijmsc.2020.02.04

Subject(s) - computer science , algorithm , turnaround time , fair share scheduling , poisson distribution , scheduling (production processes) , dynamic priority scheduling , parallel computing , rate monotonic scheduling , central processing unit , mathematical optimization , mathematics , operating system , statistics , schedule

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research