Abstract: When executing different real-time applications on a single
processor system, one problem is how to compose these applications and
guarantee at the same time that their timing requirements are not violated. A
possible way of composing applications is through the resource reservation
approach. Each application is handled by a dedicated server that is assigned a
fraction of the processor. Using this approach, the system can be seen as a
two-level hierarchical scheduler. A considerable amount of work has been
recently addressed to the analysis of this kind of hierarchical systems.
However, a question is still unanswered: given a set of real-time tasks to be
handled by a server, how to assign the server parameters so that the task set
is feasible? In this paper, we answer to the previous question for the case of
fixed priority local scheduler by presenting a methodology for computing the
class of server parameters that make the task set feasible.