Transformation Methods for Off-line Schedules to Attributes for Fixed Priority Scheduling

Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, end-to-end deadlines, etc.) that are typically achieved by using off-line scheduling. The rigid off-line scheduling schemes used, however, do not provide for flexibility. FPS has been widely studied and used in a number of industrial applications, e.g., CAN bus, mostly due to its simple run-time scheduling and small overhead. It can provide more flexibility, but is limited with respect to predictability, as actual start and completion times of executions depend on run-time events.In this work we show how off-line scheduling and FPS run-time scheduling can be combined to get the advantages of both -- the capability to cope with complex timing constraints while providing run-time flexibility. The proposed approaches assume that a schedule for a set of tasks with complex constraints has been constructed off-line. We present methods to analyze the off-line schedule and derive FPS attributes, e.g., priorities, offsets, and periods, such that the runtime FPS execution matches the off-line schedule. The basic idea is to analyze the schedule and to derive task attributes for fixed priority scheduling. In some cases, i.e., when the off-line schedule can not be expressed directly by FPS, we split tasks into instances to obtain a new task set with consistent task attributes. Furthermore, we provide a method to keep the number of newly generated artifact tasks minimal.Finally, we apply the proposed method to schedule messages with complex constraints on Controller Area Network (CAN). We analyze an off-line schedule constructed to solve complex constraints for messages, e.g., precedence, jitter or end-to-end deadlines, and we derive attributes, i.e., message identifiers, required by CANs native protocol. At run time, the messages are transmitted and received within time intervals such that the original constraints are fulfilled.