Scheduling algorithms and operating systems support for real-time systems (1994)
Cached
Download Links
| Venue: | Proceedings of the IEEE |
| Citations: | 101 - 1 self |
BibTeX
@INPROCEEDINGS{Ramamritham94schedulingalgorithms,
author = {Krithi Ramamritham and John and A. Stankovic},
title = {Scheduling algorithms and operating systems support for real-time systems},
booktitle = {Proceedings of the IEEE},
year = {1994},
pages = {55--67}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper summarizes the state of the real-time field in the areas of scheduling and operating system kernels. Given the vast amount of work that has been done by both the operations research and computer science communities in the scheduling area, we discuss four paradigms underlying the scheduling approaches and present several exemplars of each. The four paradigms are: static table-driven scheduling, static priority preemptive scheduling, dynamic planning-based scheduling, and dynamic best efSort 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 needs of predictable real-time systems. We discuss several research kernels that are currently being built to explicitly meet the needs of real-time applications. I.
