This paper summarizes the state of the real-time eld in the areas of scheduling and operating system kernels. Given the vast amount o f w ork that has been done by b o t h t h e operations research and computer science communities in the scheduling area, we discuss four paradigms underlying the scheduling approaches and present s e v eral exemplars of each. The four paradigms are: static table-driven scheduling, static priority preemptive scheduling, dynamic planning-based scheduling, and dynamic best-e ort scheduling. In the operating system context, we argue that most of the proprietary commercial kernels as well as real-time extensions to timesharing operating system kernels do not t the needs of predictable real-time systems. We discuss several research k ernels that are currently being built to explicitly meet the needs of real-time applications.
K. Ramamritham and J. A. Stankovic REF discuss the four paradigms underlying the scheduling approaches in real-time systems, namely, static table-driven scheduling, static priority preemptive scheduling, dynamic planning-based scheduling, and dynamic best-effort scheduling.
Scheduling algorithms and operating systems support for real-time systems
Proceedings of the IEEE
Computer Science