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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
3 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Titel2016 11th IEEE International Symposium on Industrial Embedded Systems (SIES), Krakow, Poland, 23-25 May 2016 : Proceedings
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Aantal pagina's8
ISBN van geprinte versie978-1-5090-2282-3
DOI's
StatusGepubliceerd - 2016
Evenement11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland - Krakow, Polen
Duur: 23 mei 201625 mei 2016
http://sies2016.org/

Congres

Congres11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland
Verkorte titelSIES 2016
LandPolen
StadKrakow
Periode23/05/1625/05/16
Internet adres

Vingerafdruk Duik in de onderzoeksthema's van 'Tight temporal bounds for dataflow applications mapped onto shared resources'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    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