Real-Time scheduling Problem Solver/Generator
Consider n tasks that are executed periodically on a single processor.
Choose the number of tasks, and the desired scheduling protocol to generate values for
execution times and periods that satisfy the problem description.
You can also provide the periods of the tasks p1 ... pn and execution times e1 ... en-1 and ask for the execution time en .
Below you can find the original exercise problem.
Problem Description and Parameters
Original Problem: Earliest Deadline First Scheduling
This problem studies dynamic-priority scheduling. Consider two tasks to be executed periodically
on a single processor, where task 1 has period p1 = 4 and task 2 has period p2 = 6. Let the deadlines
for each invocation of the tasks to be the end of their period. That is the first invocation of
task 1 has deadline 4, the second invocation of task 1 has deadline 8, and so on.
Let the execution time of task 1 be e1 = 1. Find the maximum value for the execution time
e2 of task 2 such that EDF is feasible.
Solution to EDF Schedule
Generated Problem
This problem studies dynamic-priority scheduling. Consider tasks executed periodically on a single processor, where the tasks have periods
and let the deadlines for each invocation of the tasks to be the end of their period. Let the execution time of the tasks to be
Find the maximum value
for the execution time
e