Resource partitioning among real-time applications

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.

[1]  Alan Burns,et al.  New results on fixed priority aperiodic servers , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[2]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[4]  Shuichi Oikawa,et al.  Resource kernels: a resource-centric approach to real-time and multimedia systems , 2001, Electronic Imaging.

[5]  Hermann Kopetz,et al.  Distributed fault-tolerant real-time systems: the Mars approach , 1989, IEEE Micro.

[6]  Aloysius K. Mok,et al.  A model of hierarchical real-time virtual resources , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[7]  Hideyuki Tokuda,et al.  Applying Hard Real-Time Technology to Multimedia Systems , 1993 .

[8]  Giorgio C. Buttazzo,et al.  The space of rate monotonic schedulability , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[9]  Theodore P. Baker,et al.  Aperiodic servers in a deadline scheduling environment , 2005, Real-Time Systems.

[10]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[11]  Aloysius K. Mok,et al.  Resource partition for real-time systems , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

[12]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[13]  Z. Deng,et al.  A scheme for scheduling hard real-time applications in open system environment , 1997, Proceedings Ninth Euromicro Workshop on Real Time Systems.

[14]  Dickon Reed,et al.  Nemesis, The Kernel - Overview , 1997 .

[15]  Giorgio C. Buttazzo,et al.  Integrating multimedia applications in hard real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[16]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

[17]  James H. Anderson,et al.  Proportional share scheduling of operating system services for real-time applications , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[18]  Sanjoy K. Baruah,et al.  Efficient scheduling of real-time multi-task applications in dynamic systems , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[19]  Aloysius K. Mok,et al.  Towards compositionality in real-time resource partitioning based on regularity bounds , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[20]  Jane W.-S. Liu,et al.  Scheduling real-time applications in an open environment , 1997, Proceedings Real-Time Systems Symposium.

[21]  Tei-Wei Kuo,et al.  A fixed-priority-driven open environment for real-time applications , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[22]  John P. Lehoczky,et al.  Analysis of hierar hical fixed-priority scheduling , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[23]  Marco Spuri,et al.  Scheduling aperiodic tasks in dynamic priority systems , 1996, Real-Time Systems.