Abstract | |
|
Back to Advance Program
Resource Partitioning among Real-Time ApplicationsGiuseppe Lipari and Enrico BiniTo appear at Euromicro Conference on Real-Time Systems (ECRTS03), Porto, Portugal, 2-4 July 2003
AbstractWhen executing different real-time applications in 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 periodic server that is assigned a certain fraction of the processor. Using this approach, the system can be seen as a two-level hierarchical scheduler: a global scheduler selects which server is to be executed next; each server then selects which application tasks will be executed depending on a local scheduling algorithm. A considerable amount of work has been recently addressed to the analysis of this kind of hierarchical systems. However, a question was still unanswered: given a set of real-time tasks to be handled by a server with a fixed priority local scheduler, how to assign the server parameters so that the task set is feasible? In this paper, we provide an answer to the previous question: we present a methodology for computing the class of server parameters that make the task set feasible. The application designer can then choose the best server parameters depending on her/his needs.
10 Mar 2003 at 21:02:28 |