A quick view over response time upper bounds
Response Time Upper Bounds deals with one of the most common problems found in the study of real time scheduling: calculate the feasibility of sequence of tasks for real time constraints. Several scheduling methods have been already proposed for different system models and exact mechanism, such us response time analysis, are already available. However, Davis and Burns present a generic formula, which is applicable to a wider system model and with a computational order of O(n), which can be very useful, for instance, for those system of low processing constraints. This paper presents a review of Davis and Burns method, analyzing the upper bound and their technical approach by means of some examples. In addition, the upper bound is also analyzed in the context of mixed-preemption relations scheduling technique presented by Regehr.