Fixed priority scheduling with deadlines prior to completion

Standard analysis for fixed priority scheduling assumes that all the computations for each task must be completed by the task's deadline. In practice this is rarely the case. The deadline is more correctly associated with the last observable event of the task, interval events and kernel overhea...

Full description

Saved in:
Bibliographic Details
Published inProceedings Sixth Euromicro Workshop on Real-Time Systems pp. 138 - 142
Main Authors Burns, A., Tindell, K., Wellings, A.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1994
Subjects
Algorithm design and analysis
Bandwidth
Computer science
Costs
Kernel
Processor scheduling
Protection
Protocols
Real time systems
Switches
Online AccessGet full text

Cover

More Information
Summary:Standard analysis for fixed priority scheduling assumes that all the computations for each task must be completed by the task's deadline. In practice this is rarely the case. The deadline is more correctly associated with the last observable event of the task, interval events and kernel overheads (such as the context switch away from the task) can occur after the deadline. New analysis is presented that caters for this situation. The result is enhanced schedulability without modification to the preemptive behaviour of the run-time system.< >
ISBN:9780818663406
0818663405
DOI:10.1109/EMWRTS.1994.336852