Towards compositionality in real-time resource partitioning based on regularity bounds

In real-time resource partitioning, a shared resource is partitioned by a resource-level scheduler such that each partition is accessible only by an individual application task group. Tasks within the same task group are scheduled by an application-task-level scheduler that is specialized to the real-time requirements of the tasks in the group. An ideal goal for resource partitioning in real-time systems is to achieve a complete separation of concerns so that: (1) each task group may be executed as if it had access to its own dedicated resource, and (2) there is minimal interaction between the resource-level scheduler and the application-task-level scheduler. In [15], we introduced the notion of a real-time virtual resource which operates at a fraction of the rate of the shared physical resource and whose rate of operation varies with time but is bounded. In this paper we discuss an approach to bound the variation of the rate of operation of a real-time virtual resource by characterizing the rate variation from both temporal and supply dimensions and by expanding on the concept of regularity that was first introduced in [19]. For the case of regular resource partitioning, we show that the utilization bounds of both fixed-priority scheduling and dynamic-priority scheduling remain unchanged from those for dedicated resources. We determine the utilization bounds for the more general case of irregular partitioning. In particular, both types of partitions can be efficiently constructed by exploiting compositionality, properties vis-a-vis the regularity measure.

[1]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2]  Mohamed F. Younis,et al.  Partition scheduling in APEX runtime environment for embedded avionics software , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[3]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[4]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[5]  Sanjoy K. Baruah,et al.  A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[6]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[7]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[8]  Andy J. Wellings,et al.  Analysing APEX applications , 1996, 17th IEEE Real-Time Systems Symposium.

[9]  Francis Y. L. Chin,et al.  General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction , 1992, IEEE Trans. Computers.

[10]  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.

[11]  Tei-Wei Kuo,et al.  An open real-time environment for parallel and distributed systems , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

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

[13]  S. Shirero,et al.  On the schedulability conditions on partial time slots , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[14]  Tei-Wei Kuo,et al.  Efficient on-line schedulability tests for priority driven real-time systems , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[15]  Kwei-Jay Lin,et al.  An optimal pinwheel scheduler using the single-number reduction technique , 1996, 17th IEEE Real-Time Systems Symposium.

[16]  Rushby John,et al.  Partitioning in Avionics Architectures: Requirements, Mechanisms, and Assurance , 1999 .

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

[18]  Sanjoy K. Baruah,et al.  Overload tolerance for single-processor workloads , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).

[19]  Sanjoy K. Baruah,et al.  Scheduling periodic task systems to minimize output jitter , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).