gantt chart maker for scheduling algorithms

the short-term scheduler ) to select another process from the ready queue to run next. Whenever the CPU becomes idle, it is the job of the CPU Scheduler ( a.k.a.CPU bursts vary from process to process, and from program to program, but an extensive study shows frequency patterns similar to that shown in Figure 5.2:.An I/O burst, waiting for data transfer in or out of the system.A CPU burst of performing calculations, and.Almost all processes alternate between two states in a continuing cycle, as shown in Figure 5.1 below :.The challenge is to make the overall system as 'efficient' and 'fair' as possible, subject to varying and often dynamic conditions, and where 'efficient' and 'fair' are somewhat subjective terms, often subject to shifting priority policies.A scheduling system allows one process to use the CPU while another is waiting for I/O, thereby making full use of otherwise lost CPU cycles.

In a simple system running a single process, the time spent waiting for I/O is wasted, and those CPU cycles are lost forever.

( Even a simple fetch from memory takes a long time relative to CPU speeds. )

Almost all programs have some alternating cycle of CPU number crunching and waiting for I/O of some kind.

Abraham Silberschatz, Greg Gagne, and Peter Baer Galvin, 'Operating System Concepts, Eighth Edition ', Chapter 5.

Gantt chart maker for scheduling algorithms