SCHEDULING ALGORITHMS AND OPERATING-SYSTEMS SUPPORT FOR REAL-TIME SYSTEMS

This paper summarizes the state of the real-time field in the areas of scheduling and operating system kernels. Given the vast amount of wor k that has been done by both the operations research and computer scie nce communities in the scheduling al ea, we discuss four paradigms und erlying the scheduling approaches and present several exemplars of eac h. The Soul paradigms are: static table-driven scheduling, static prio rity preemptive scheduling, dynamic planning-based scheduling, and dyn amic best effort scheduling. In the operating system context, we argue that most of the proprietary commercial kernels as well as real-time extensions to time-sharing operating system kernels do not fit the nee ds of predictable real-time systems. We discuss several research kerne ls that al e currently being built to explicitly meet the needs of rea l-time applications.