A Critical Simulation of CPU Scheduling Algorithm using Exponential Distribution
Maria M. Abur, Aminu Mohammed, Sani Danjuma, Saleh El-Yakub Abdullahi · 2011
A multiprogramming operating system allows more than one process to be loaded into the executable memory at a time and for the loaded process to share the CPU using time-multiplexing. Part of the reason for using multiprogramming is that the operating system itself is implemented as one or more processes, so there must be a way for the operating system and application processes to share the CPU. The assignment of physical processors to processes allows processors to accomplish work. The problem of determining when processors should be assigned and to which processes is called CPU scheduling. How do we select a CPU Scheduling algorithm for a particular system? Since we have different scheduling algorithm with its own parameter selection can be difficult. To select an algorithm we must first define the relative importance of CPU Scheduling criteria. Next we use an evaluation method. This paper presents an algorithm and a life simulation of the CPU Scheduling algorithms using exponential distribution to generate the random numbers for the burst times, arrival times and processes with Ms Visual Basic 2010 for the Scheduling algorithms and comparing their average waiting time to know which has the least average waiting time.