Real Time Scheduling Schemes

Real-Time Scheduling Schemes: Using the dataset T1(Execution Time=2, Period=4), T2(Execution Time=3, Period=8), T3(Execution Time=4, Period=24), schedule the tasks using Earliest Deadline First (EDF), compute CPU utilization and constraints, and compare the results with RMS.

In a factory, gas monitoring takes 2 ms every 5 ms, temperature analysis takes 3 ms every 7 ms, and alarm logging takes 4 ms every 10 ms. Analyse the operations using Earliest Deadline First (EDF) scheduling, construct the timeline chart for 20 ms, identify any missed deadlines, and suggest suitable methods to avoid deadline misses.

Evaluate how the following parameters affect the schedulability of real-time tasks: Arrival Time, Current Time (Scheduling Point), Execution Time, Rate/Period, and Deadline. Suggest an optimal scheduling scheme using any three relevant parameters and apply it to the given datasets. Draw the task timeline graph as specified.

Compute CPU utilization and determine whether the given task set is schedulable in RTOS. Apply both RMS and EDF algorithms to the dataset T1(Start Time=0, Execution Time=10, Deadline=30, Period=30), T2(Start Time=4, Execution Time=3, Deadline=10, Period=10), T3(Start Time=5, Execution Time=10, Deadline=25, Period=25). Draw the task timeline graph for two cycles.