Applying compiler techniques to scheduling in real-time systems
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 247-256
- https://doi.org/10.1109/real.1990.128755
Abstract
Worst-case scheduling techniques for real-time applications often result in sever underutilization of the processor resources since most tasks finish in much less time than their anticipated worst-case execution times. A description is presented of compiler-based techniques that classify the application code on the basis of predictability and monotonicity, introduce measurement code fragments at selected points in the application code, and use the results of run-time measurements to dynamically adapt worst-case schedules. This results in better utilization of the system and early failure detection and recovery.Keywords
This publication has 3 references indexed in Scilit:
- Application of real-time monitoring to scheduling tasks with random execution timesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Real-time scheduling theory and AdaComputer, 1990
- Determining average program execution times and their variancePublished by Association for Computing Machinery (ACM) ,1989