Issue No. 06 - June (1995 vol. 28)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.386982
Important classical scheduling theory results for real-time computing are identified. Implications of these results from the perspective of a real-time systems designer are discussed. Uni- processor and multiprocessor results are addressed as well as important issues such as future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic scheduling, preemption versus non-preemption, multiprocessing anomalies, and metrics. Examples of what scheduling algorithms are used in actual applications are given.
scheduling theory, real-time, uniprocessor scheduling, multiprocessor scheduling
G. C. Buttazzo, M. Spuri, J. A. Stankovic This work was done while the and M. Di Natale, "Implications of Classical Scheduling Results for Real-Time Systems," in Computer, vol. 28, no. , pp. 16-25, 1995.