Definition of a new type of a hierarchical system when the scheduling policy is not known in the global level.Definition of CPU supply functions that are schedulable for these kind of systems.Schedulability analysis of these kind of systems.Evaluation of the proposed solution. Partitioned architectures isolate software components into independent partitions whose execution will not interfere with other partitions, preserving temporal and spatial isolation. Hierarchical scheduling can effectively be used to schedule these systems. Schedulability analysis of hierarchical real-time systems is based on prior knowledge of the local and the global scheduling algorithms.In a partitioned system with safety and security issues and certification assurance levels, global scheduling is usually generated using a static table. Therefore, each partition must allocate task jobs only in the temporal windows reserved for that partition. Even if the static table can come originally from a periodic server or other scheduling policy, the final plan may be modified due to changes in the system requirements. As a consequence, the CPU assignment to a partition does not have to correspond to any known policy. In this case, it is not possible to use existing scheduling analysis for hierarchical systems.This paper studies a new scheduling problem: a hierarchical system in which global policy is not known but provided as a set of arbitrary time windows.
['Ana Guasque', 'Patricia Balbastre', 'Alfons Crespo']
Real-time hierarchical systems with arbitrary scheduling at global level