International Journal of Computing and Business Research (IJCBR)
In this paper, the authors present a simulating the behavior of CPU scheduling algorithms using exponential distribution function. It is very hard to analyze the waiting time when the number of processes are large .when the processes is loaded in the ready queue, then it passes to CPU for execution. The selection of the processes from the ready queue is done through the various CPU scheduling algorithms. In this paper, simulation is done through random no generator using exponential distribution function for arrival and burst time of processes.