Kurtin, P. and Bekooij, M.J.G.
Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models.
Technical Report TR-CTIT-16-10,
Centre for Telematics and Information Technology, University of Twente, Enschede, The Netherlands.
Full text available as:
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.
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-CAES: Computer Architecture for Embedded Systems|
|Research Project:||CPS-CD: Robust design of cyber-physical systems|
|Additional Information:||The paper corresponding to this appendix can be found at http://dx.doi.org/10.1145/2993452.2993564|
|Uncontrolled Keywords:||Appendix, Temporal Analysis, Real-Time, Streaming Applications, MPSoCs, Static Priority Preemptive Scheduling, CSDF|
|Deposited On:||05 September 2016|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item