Fixed priority scheduling with deadlines prior to completion

• Published in: Proceedings Sixth Euromicro Workshop on Real-Time Systems pp. 138 - 142
• Main Authors: Burns, A., Tindell, K., Wellings, A.J.
• Format: Conference Proceeding
• Language: English
• Published: IEEE Comput. Soc. Press 1994
• Subjects: Algorithm design and analysis; Bandwidth; Computer science; Costs; Kernel; Processor scheduling; Protection; Protocols; Real time systems; Switches

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...