Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models
Philip S. Kurtin, Marco J.G. Bekooij · University of Twente Research Information · 2016
This is the appendix to the paper Temporal Analysis of Static Priority Preemptive Scheduled Cyclic Streaming Applications using CSDF Models [1]. The temporal analysis approach presented in [1] makes use of an iterative algorithm that computes so-called maximum busy periods over multiple task phases. The algorithm contains a stop criterion indicating after which iteration of the algorithm subsequent iterations do not need to be considered. The intuition behind that stop criterion is given in the paper and supplemented by a formal proof in this appendix.