Abstract
The deadline-driven scheduler of Liu and Layland [85] is considered in this chapter. The main idea of the scheduler was given in Chap. 1. The correctness proof for the deadline-driven scheduler will be carried out carefully to illustrate that the proof theory of the previous two chapters can manage a nontrivial proof. The steps of the proof wil not, however, be given in as much detail as in the previous chapters and we shall omit some simple steps and annotations that we have described earlier.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chaochen, Z., Hansen, M.R. (2004). Deadline-Driven Scheduler. In: Duration Calculus. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06784-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-06784-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07404-2
Online ISBN: 978-3-662-06784-0
eBook Packages: Springer Book Archive