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

11 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).
Kurtin, Philip Sebastian ; Bekooij, Marco Jan Gerrit. / Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models. Enschede, The Netherlands : Centre for Telematics and Information Technology (CTIT), 2016. 4 p. (CTIT Technical Report Series; TR-CTIT-16-10).
@book{ed8b20b9f42848f8beb277b87c5742e8,
title = "Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models",
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.",
keywords = "Static Priority Preemptive Scheduling, Streaming Applications, Temporal Analysis, Real Time, Appendix, MPSoCs, CSDF, METIS-318503, IR-101055, EWI-27175",
author = "Kurtin, {Philip Sebastian} and Bekooij, {Marco Jan Gerrit}",
note = "The paper corresponding to this appendix can be found at http://dx.doi.org/10.1145/2993452.2993564",
year = "2016",
month = "9",
day = "2",
language = "English",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "TR-CTIT-16-10",
address = "Netherlands",

}

Kurtin, PS & Bekooij, MJG 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, Centre for Telematics and Information Technology (CTIT), Enschede, The Netherlands.

Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models. / Kurtin, Philip Sebastian; Bekooij, Marco Jan Gerrit.

Enschede, The Netherlands : Centre for Telematics and Information Technology (CTIT), 2016. 4 p. (CTIT Technical Report Series; No. TR-CTIT-16-10).

Research output: Book/ReportReportProfessional

TY - BOOK

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

AU - Kurtin, Philip Sebastian

AU - Bekooij, Marco Jan Gerrit

N1 - The paper corresponding to this appendix can be found at http://dx.doi.org/10.1145/2993452.2993564

PY - 2016/9/2

Y1 - 2016/9/2

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

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

KW - Static Priority Preemptive Scheduling

KW - Streaming Applications

KW - Temporal Analysis

KW - Real Time

KW - Appendix

KW - MPSoCs

KW - CSDF

KW - METIS-318503

KW - IR-101055

KW - EWI-27175

M3 - Report

T3 - CTIT Technical Report Series

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

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede, The Netherlands

ER -

Kurtin PS, Bekooij MJG. Appendix to Temporal analysis of static priority preemptive scheduled cyclic streaming applications using CSDF models. Enschede, The Netherlands: Centre for Telematics and Information Technology (CTIT), 2016. 4 p. (CTIT Technical Report Series; TR-CTIT-16-10).