Period and Deadline Selection Problem for Real-Time Systems

Task period adaptations are often used to alleviate tem-poral overload conditions in real-time systems, as they per-mit performance guarantee. Existing frameworks assume that only task periods are adjustable parameters and that task deadlines remain unchanged at all times. This paper formally introduces a more general real-time task model where task deadlines, which are less than or equal to task periods, are functions of task periods. This tight coupling between task deadlines and task periods has been discussed in a recent work in control systems and presents a novel real-time scheduling challenge. To solve this period and deadline selection problem, this paper presents some anal-yses in helping to identify feasible period-deadline combi-nations and proposes a heuristic for finding a schedulable task set.