The many faces of multi-level real-time scheduling

Many real-time scheduling algorithms use simplistic sets of assumptions and this limits their applicability in practice. Often, a large real-time system has multiple scheduling algorithms and multi-level scheduling algorithms. Multiple algorithms arise when it is possible to partition the system into subsystems, each with their own algorithm. While this is a valuable approach, in this paper we focus on the issue of multi-level scheduling. Multi-level scheduling arises for various important reasons. In this invited presentation we discuss multi-level scheduling examples from a process/thread model, local/distributed scheduling, manufacturing, and multimedia.

[1]  Krithi Ramamritham,et al.  The Spring kernel: a new paradigm for real-time systems , 1991, IEEE Software.

[2]  Krithi Ramamritham,et al.  Real-time platforms and environments for time constrained flexible manufacturing , 1994, Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software.

[3]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

[4]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[5]  Krithi Ramamritham,et al.  Scheduling Strategies Adopted in Spring: An Overview , 1991 .

[6]  John A. Stankovic,et al.  Continuous and multimedia OS support in real-time control applications , 1995, Proceedings 5th Workshop on Hot Topics in Operating Systems (HotOS-V).