Essay On Scheduling Algorithms

950 Words2 Pages

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 defining the criteria to be used in selecting an algorithm. The criteria are often defined in terms of CPU utilization, waiting time, response time, or throughput. To select an algorithm, we must first define the relative importance of these elements. Our criteria may include several measures, such as these:
• Maximizing CPU utilization under the constraint that the maximum response time is 1 second
• Maximizing throughput such that turnaround time is (on average) linearly proportional to total execution time
Once the selection criteria have been defined, evaluate the algorithms under consideration. There are various methods available to evaluate the algorithms: Deterministic Modelling, 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 involve programming a model of the computer system. Software data structures represent the major components of the system. The simulator has a variable representing a clock. As this variable’s value is increased, the simulator modifies the system state to reflect the activities of the devices, the processes, and the scheduler. As the simulation executes, statistics that indicate algorithm performance are gathered and printed.
The data to drive the simulation can be generated in several ways. The most common method uses a random-number generator that is programmed to generate processes; CPU burst times, arrivals, departures, and so on, according to probability distr...

... middle of paper ...

...heduling multiple processes on different processors is one of the most challenging problems in multi process operating system. Real time short term scheduler is well adapted to multiprocessor scheduling problems.
In this project, a short term scheduler is introduced for scheduling the tasks in multi process real time systems. The scheduler based on moving the events on a logical time scale and it simultaneously allocates different processes to different processors on the system.
The analysis of output obtained from the scheduler reveals that minimization of waiting time and maximization of CPU utilization is accomplished. It also states that average waiting time is waived before any process is being serviced. The overall computed summary statistics reveal that Real Time Short Term scheduler can be the solution for scheduling the processes in a multiprocessor system.

More about Essay On Scheduling Algorithms

Open Document