Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models

Philip Sebastian Kurtin, Marco Jan Gerrit Bekooij

    Research output: Book/ReportReportProfessional

    17 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Place of PublicationEnschede, The Netherlands
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages4
    Publication statusPublished - 2 Sep 2016

    Publication series

    NameCTIT Technical Report Series
    PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)
    No.TR-CTIT-16-10
    ISSN (Print)1381-3625

    Keywords

    • Static Priority Preemptive Scheduling
    • Streaming Applications
    • Temporal Analysis
    • Real Time
    • Appendix
    • MPSoCs
    • CSDF
    • METIS-318503
    • IR-101055
    • EWI-27175

    Cite this

    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).