Algorithm Descriptions
1. Rate Monotonic Scheduling (RMS): One of the most promising methods of resolving multitask scheduling conflicts for periodic tasks. The task's period, T, is the amount of time between the arrival of one instance of the task and the arrival of the next instance of the task. A task's rate is simply the inverse of its period. The execution time, C, is the amount of processing time required for each occurence of the task. It should be clear that in a uniprocessor system, the execution time must be no greater than the period (must have C<= T). Utilization of the processor is U = C/T. For RMS, the highest-priority task is the one with the shortest period. For RMS it can be shown that the following inquality holds: C1/T1 + C2/T2 + .. + Cn/Tn <= n(2 1/n -1)
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
Period: Time after which a process is repeated.
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