The problem of calculating the worst case response time for a task set is one of the key problem in the scheduling theory. To obtain the worst-case bounds for a variety of scheduling models a different modifications of the busy-interval method are used. All such proofs have similar scheme and that similarity can be used to find the essence part of the proof for its further use. In the talk, we will consider the proof of the theorem, and also we will give concrete examples of obtaining "free" bounds for such different models as FP (fixed priority) and EDF (earliest deadline first).
Presenter --- Sergey Bozhko
Date: December 11, 2017
Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28