Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints

Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, such as period and deadline, or complex, e.g., to express application specific or non temporal constraints, reliability, performance, etc. Arrival patterns determine whether tasks will be treated as periodic, sporadic, or aperiodic. As many algorithms focus on specific sets of task types and constraints only, system design has to focus on those supported by a particular algorithm, at the expense of the rest. In this paper, we present an algorithm to deal with a combination of mixed sets of tasks and constraints: periodic tasks with complex and simple constraints, soft and firm aperiodic, and sporadic tasks. Instead of providing an algorithm tailored for a specific set of constraints, we propose an EDF based runtime algorithm, and the use of an offline scheduler for complexity reduction to transform complex cons...

• Type: Conference
• Year: 2000
• Where: RTSS
• Authors: Damir Isovic, Gerhard Fohler
• Keywords: Control Systems, Non Temporal Constraints, RTSS 2000, Sporadic Tasks, Standard Timing Constraints