Algorithm Descriptions
1. First Come First Served (FCFS):As each process becomes ready, it joins the ready queue. When the currently running process ceases to execute, the oldest process in the ready queue is selected for running. The only difference is that if the starting deadline of a process is passed while waiting to go on the processor it is dropped from the ready queue and is never scheduled.
2. Earliest Deadline with Unforced Idle Times (EDUIT): This algorithm always schedules the eligible task with the earliest deadline and run it to completion. An eligible task may not be ready and this may result in the processor remaining idle even though there are ready tasks.
Helpful Hints
Process Name:Name of the process is entered in this field
Arrival Time: Time when the process enters the ready queue
Service time (Ts): average service time, average time spent in running state
Starting Deadline: Time by which the process should be executed. If the algorithm fails to schedule a process before the starting deadline, the process is dropped from the ready queue.
Finish time: Time for a process to finish
Turnaround time (Tq): turnaround time, total time in system, waiting plus execution.
Tq/Ts : is the normalized turnaround time. This value indicates the relative delay experienced by a process. Typically, the longer the process execution time, the greater the absolute amount of delay that can be tolerated. The minimum possible value of this ratio is 1.0; increasing values correspond to a decreasing level of service.
Status: All the steps of the selected algorithm are displayed in detail while the simulation is running
Speed Bar: Can be used to control the speed of the simulation
Drop Dowm: To select the algorithms described above
Run: Button to start the simulation