@INPROCEEDINGS{Altmeyer09a,
  author = {Sebastian Altmeyer and Claire Burgui\`ere and Reinhard Wilhelm},
  title = {Computing the Maximum Blocking Time for Scheduling with Deferred 
Preemption},
  booktitle = {Workshop on Software Technologies for Future Dependable 
Distributed Systems},
  year = {2009},
  subproject={R2},
  access={restricted},
  bibtex={max_blocking_time.bib},
  pdf={max_blocking_time.pdf},
  abstract={Deferred preemption enables a trade-off between the high dynamics of a 
preemptive schedule on the one hand, and the predictability of a non-
preemptive system on the other hand. In addition to bounds on the  execution 
time and the context switch costs, the schedulability analysis for deferred 
preemption needs the maximum time a preemption can be delayed, also called 
maximum blocking time. Scheduling theory is based on an abstract level where  
these values are assumed to be given. So far, the computation of the maximum  
blocking time, however, has not been studied in detail. In this paper, we 
propose a new method to derive the maximum blocking time of  a task given a 
fixed set of preemption points. To derive a safe upper bound, our approach 
also includes the context switch costs that might increase the maximum 
blocking time.},
}