Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers

J.P.H.M. Hausmans, S.J. Geuns, M.H. Wiggers, Marco Jan Gerrit Bekooij

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
4 Downloads (Pure)

Abstract

Real-time stream processing applications often contain multi-rate behavior. This multi-rate behavior can be accurately modeled using Synchronous Dataflow (SDF) graphs. However, no temporal analysis technique exists which is applicable for arbitrary cyclic SDF graphs and can handle cyclic resource dependencies. This paper presents a temporal analysis flow for SDF graphs which is applicable for systems with non-starvation-free schedulers such as static priority pre-emptive schedulers. The analysis flow uses an enabling rate characterization to calculate response times. This enabling rate characterization is determined using multi-dimensional periodic schedules and allows a more accurate modeling of enabling patterns than is possible with a characterization that is based on periods and enabling jitters. The presented approach is applicable for arbitrary (cyclic) graph topologies and can take buffer capacity constraints into account during analysis. Also cyclic resource dependencies can be analyzed. The presented analysis flow is the first approach that considers arbitrary SDF graph topologies in combination with cyclic resource dependencies that are caused by non-starvation-free schedulers. The proposed analysis flow is evaluated using a radio processing application. The analysis results are obtained using a tool in which the analysis flow is implemented. This case-study illustrates that the used enabling characterization achieves up to 87% better response times than with an enabling jitter based characterization.
Original languageEnglish
Title of host publicationProceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014
Place of PublicationNew York
PublisherAssociation for Computing Machinery (ACM)
Pages108-117
Number of pages10
ISBN (Print)978-1-4503-2941-5
DOIs
Publication statusPublished - 11 Jun 2014
Event17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014 - St. Goar, Germany
Duration: 10 Jun 201411 Jun 2014
Conference number: 17
http://www.scopesconf.org/scopes-14/

Conference

Conference17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014
Abbreviated titleSCOPES
CountryGermany
CitySt. Goar
Period10/06/1411/06/14
Internet address

Fingerprint

Jitter
Topology
Processing

Keywords

  • EWI-24785
  • METIS-304112
  • IR-91343

Cite this

Hausmans, J. P. H. M., Geuns, S. J., Wiggers, M. H., & Bekooij, M. J. G. (2014). Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers. In Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014 (pp. 108-117). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/2609248.2609262
Hausmans, J.P.H.M. ; Geuns, S.J. ; Wiggers, M.H. ; Bekooij, Marco Jan Gerrit. / Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers. Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014. New York : Association for Computing Machinery (ACM), 2014. pp. 108-117
@inproceedings{437d259e6f78469c9a7d4e562dbeccc5,
title = "Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers",
abstract = "Real-time stream processing applications often contain multi-rate behavior. This multi-rate behavior can be accurately modeled using Synchronous Dataflow (SDF) graphs. However, no temporal analysis technique exists which is applicable for arbitrary cyclic SDF graphs and can handle cyclic resource dependencies. This paper presents a temporal analysis flow for SDF graphs which is applicable for systems with non-starvation-free schedulers such as static priority pre-emptive schedulers. The analysis flow uses an enabling rate characterization to calculate response times. This enabling rate characterization is determined using multi-dimensional periodic schedules and allows a more accurate modeling of enabling patterns than is possible with a characterization that is based on periods and enabling jitters. The presented approach is applicable for arbitrary (cyclic) graph topologies and can take buffer capacity constraints into account during analysis. Also cyclic resource dependencies can be analyzed. The presented analysis flow is the first approach that considers arbitrary SDF graph topologies in combination with cyclic resource dependencies that are caused by non-starvation-free schedulers. The proposed analysis flow is evaluated using a radio processing application. The analysis results are obtained using a tool in which the analysis flow is implemented. This case-study illustrates that the used enabling characterization achieves up to 87{\%} better response times than with an enabling jitter based characterization.",
keywords = "EWI-24785, METIS-304112, IR-91343",
author = "J.P.H.M. Hausmans and S.J. Geuns and M.H. Wiggers and Bekooij, {Marco Jan Gerrit}",
note = "eemcs-eprint-24785",
year = "2014",
month = "6",
day = "11",
doi = "10.1145/2609248.2609262",
language = "English",
isbn = "978-1-4503-2941-5",
pages = "108--117",
booktitle = "Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014",
publisher = "Association for Computing Machinery (ACM)",
address = "United States",

}

Hausmans, JPHM, Geuns, SJ, Wiggers, MH & Bekooij, MJG 2014, Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers. in Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014. Association for Computing Machinery (ACM), New York, pp. 108-117, 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014, St. Goar, Germany, 10/06/14. https://doi.org/10.1145/2609248.2609262

Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers. / Hausmans, J.P.H.M.; Geuns, S.J.; Wiggers, M.H.; Bekooij, Marco Jan Gerrit.

Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014. New York : Association for Computing Machinery (ACM), 2014. p. 108-117.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers

AU - Hausmans, J.P.H.M.

AU - Geuns, S.J.

AU - Wiggers, M.H.

AU - Bekooij, Marco Jan Gerrit

N1 - eemcs-eprint-24785

PY - 2014/6/11

Y1 - 2014/6/11

N2 - Real-time stream processing applications often contain multi-rate behavior. This multi-rate behavior can be accurately modeled using Synchronous Dataflow (SDF) graphs. However, no temporal analysis technique exists which is applicable for arbitrary cyclic SDF graphs and can handle cyclic resource dependencies. This paper presents a temporal analysis flow for SDF graphs which is applicable for systems with non-starvation-free schedulers such as static priority pre-emptive schedulers. The analysis flow uses an enabling rate characterization to calculate response times. This enabling rate characterization is determined using multi-dimensional periodic schedules and allows a more accurate modeling of enabling patterns than is possible with a characterization that is based on periods and enabling jitters. The presented approach is applicable for arbitrary (cyclic) graph topologies and can take buffer capacity constraints into account during analysis. Also cyclic resource dependencies can be analyzed. The presented analysis flow is the first approach that considers arbitrary SDF graph topologies in combination with cyclic resource dependencies that are caused by non-starvation-free schedulers. The proposed analysis flow is evaluated using a radio processing application. The analysis results are obtained using a tool in which the analysis flow is implemented. This case-study illustrates that the used enabling characterization achieves up to 87% better response times than with an enabling jitter based characterization.

AB - Real-time stream processing applications often contain multi-rate behavior. This multi-rate behavior can be accurately modeled using Synchronous Dataflow (SDF) graphs. However, no temporal analysis technique exists which is applicable for arbitrary cyclic SDF graphs and can handle cyclic resource dependencies. This paper presents a temporal analysis flow for SDF graphs which is applicable for systems with non-starvation-free schedulers such as static priority pre-emptive schedulers. The analysis flow uses an enabling rate characterization to calculate response times. This enabling rate characterization is determined using multi-dimensional periodic schedules and allows a more accurate modeling of enabling patterns than is possible with a characterization that is based on periods and enabling jitters. The presented approach is applicable for arbitrary (cyclic) graph topologies and can take buffer capacity constraints into account during analysis. Also cyclic resource dependencies can be analyzed. The presented analysis flow is the first approach that considers arbitrary SDF graph topologies in combination with cyclic resource dependencies that are caused by non-starvation-free schedulers. The proposed analysis flow is evaluated using a radio processing application. The analysis results are obtained using a tool in which the analysis flow is implemented. This case-study illustrates that the used enabling characterization achieves up to 87% better response times than with an enabling jitter based characterization.

KW - EWI-24785

KW - METIS-304112

KW - IR-91343

U2 - 10.1145/2609248.2609262

DO - 10.1145/2609248.2609262

M3 - Conference contribution

SN - 978-1-4503-2941-5

SP - 108

EP - 117

BT - Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014

PB - Association for Computing Machinery (ACM)

CY - New York

ER -

Hausmans JPHM, Geuns SJ, Wiggers MH, Bekooij MJG. Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on MPSoCs with non-starvation-free schedulers. In Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2014. New York: Association for Computing Machinery (ACM). 2014. p. 108-117 https://doi.org/10.1145/2609248.2609262