Deadline-Driven Scheduler

  • Zhou Chaochen
  • Michael R. Hansen
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)


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.


Closed Interval Open Interval Processor Time Inductive Step Real Arithmetic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • Michael R. Hansen
    • 2
  1. 1.Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Informatics and Mathematical ModellingTechnical University DenmarkLyngbyDenmark

Personalised recommendations