As discussed in Section 1.3, there are many scheduling algorithms, each with its own parameters. As a result, selecting an algorithm can be difficult. The first problem is to define the criteria to use in selecting an algorithm. Policies are often defined in terms of CPU usage, wait time, response time, or throughput. To select an algorithm, we must first define the relative importance of these elements. Our criteria can include several measures, such as these: • Maximize CPU utilization with the constraint that the maximum response time is 1 second • Maximize throughput such that the delivery time is (on average) linearly proportional to the total execution time Once the selection criteria have been defined, evaluate the algorithms under consideration. There are various methods available to evaluate algorithms: deterministic modeling, queuing models, simulation, and implementation. Among these methods, simulation is used to evaluate the algorithm. To get a more accurate evaluation of scheduling algorithms, we can use simulations. Running simulations involves programming a model of the computer system. Software data structures represent the main components of the system. The simulator has a variable that represents a clock. As the value of this variable increases, the simulator changes the state of the system to reflect the activities of devices, processes, and the scheduler. As the simulation runs, statistics indicating the performance of the algorithm are collected and printed. Data to drive the simulation can be generated in several ways. The most common method uses a programmed random number generator to generate processes; CPU burst times, arrivals, departures, etc., based on the probability distribution... middle of paper... Managing multiple processes on different processors is one of the most challenging problems in multiprocess operating systems. The real-time short-term scheduler is well adapted to multiprocessor scheduling problems. In this project, a short-term scheduler is introduced for task scheduling in multi-process real-time systems. The scheduler is based on moving events on a logical time scale and simultaneously assigns different processes to different processors on the system. Analysis of the output obtained from the scheduler reveals that minimization of waiting time and maximization of CPU utilization has been achieved. It is also stated that the average waiting time is cleared before any process is served. The calculated overall summary statistics reveal that the Real Time Short Term scheduler can be the solution for process scheduling in a multiprocessor system.