This is the appendix to the paper Temporal Analysis of Static Priority Preemptive Scheduled Cyclic Streaming Applications using CSDF Models . The temporal analysis approach presented in  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.
|Place of Publication||Enschede, The Netherlands|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||4|
|Publication status||Published - 2 Sep 2016|
|Name||CTIT Technical Report Series|
|Publisher||University of Twente, Centre for Telematics and Information Technology (CTIT)|
- Static Priority Preemptive Scheduling
- Streaming Applications
- Temporal Analysis
- Real Time
Kurtin, P. S., & Bekooij, M. J. G. (2016). Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models. (CTIT Technical Report Series; No. TR-CTIT-16-10). Enschede, The Netherlands: Centre for Telematics and Information Technology (CTIT).