Tight temporal bounds for dataflow applications mapped onto shared resources

H. Alizadeh Ara, M.C.W. Geilen, T. Basten, A. Baghbanbehrouzian, M. Hendriks, D. Goswami

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

3 Citations (Scopus)
3 Downloads (Pure)

Abstract

We present an analysis method that provides tight temporal bounds for applications modeled by Synchronous Dataflow Graphs and mapped to shared resources. We consider the resource sharing effects on the temporal behaviour of the application by embedding worst case resource availability curves in the symbolic simulation of the application graph. Symbolic simulation of the application results in a (max, +) characterization matrix. This matrix specifies a set of recursive linear equations in (max, +) algebra that bound the worst case execution of the application. We obtain tighter temporal bounds on the completion times of tasks than state of the art analysis. This is achieved by improving the response times of the tasks by identifying possible consecutive task executions on the resources. This enables us to use accumulated response times which are less pessimistic. Applying the new approach to real-life applications gives significant improvements over the bounds compared to state of the art.
Original languageEnglish
Title of host publication2016 11th IEEE International Symposium on Industrial Embedded Systems (SIES), Krakow, Poland, 23-25 May 2016 : Proceedings
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages8
ISBN (Print)978-1-5090-2282-3
DOIs
Publication statusPublished - 2016
Event11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland - Krakow, Poland
Duration: 23 May 201625 May 2016
http://sies2016.org/

Conference

Conference11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland
Abbreviated titleSIES 2016
CountryPoland
CityKrakow
Period23/05/1625/05/16
Internet address

    Fingerprint

Cite this

Alizadeh Ara, H., Geilen, M. C. W., Basten, T., Baghbanbehrouzian, A., Hendriks, M., & Goswami, D. (2016). Tight temporal bounds for dataflow applications mapped onto shared resources. In 2016 11th IEEE International Symposium on Industrial Embedded Systems (SIES), Krakow, Poland, 23-25 May 2016 : Proceedings Piscataway: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/SIES.2016.7509444