This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Implications of Classical Scheduling Results for Real-Time Systems
June 1995 (vol. 28 no. 6)
pp. 16-25
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.
Index Terms:
scheduling theory, real-time, uniprocessor scheduling, multiprocessor scheduling
Citation:
John A. Stankovic This work was done while the, Marco Spuri, Marco Di Natale, Giorgio C. Buttazzo, "Implications of Classical Scheduling Results for Real-Time Systems," Computer, vol. 28, no. 6, pp. 16-25, June 1995, doi:10.1109/2.386982
Usage of this product signifies your acceptance of the Terms of Use.