Simulation of CPU scheduling algorithms

The most important aspect of job scheduling is the ability to create a multi-tasking environment. A single user cannot keep either the CPU or the I/O devices busy at all times. Multiprogramming increases CPU utilization by organizing jobs so that the CPU always has something to execute. To have several jobs ready to run, the system must keep all of them in memory at the same time for their selection one-by-one. This work involves the development of a simulator for CPU scheduling. It has been developed as a comprehensive tool which runs a simulation in real time, and generates useful data to be used for evaluation. A user-friendly and mouse-driven graphical user interface has been integrated. The system has been put through extensive experimentation. The evaluation results are extremely useful for the design and development of modern operating systems. This simulator can be used for measuring the performance of different scheduling algorithms and for the understanding and training of students.