Skip to main navigation Skip to search Skip to main content

Modeling and analysis of data flow graphs using the digraph real-time task model

  • Morteza Mohaqeqi*
  • , Jakaria Abdullah
  • , Wang Yi
  • *Corresponding author for this work
  • Uppsala University

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

Abstract

Data flow graphs are widely used for modeling and analysis of real-time streaming applications in which having a predictable and reliable implementation is an essential requirement. In this paper, we consider scheduling a set of data flow graphs such that liveness and boundedness properties are guaranteed, which leads to a predictable and correct behavior of the application. A formal translation method is proposed to map a given set of data flow graphs to a set of graph-based real time tasks. Additionally, sufficient conditions are derived under which the obtained task set provides a semantically correct implementation of the given data flow graphs. It is shown that the proposed approach provides a higher level of design flexibility compared to the existing methods which use a simpler, i.e. periodic, task model.

Original languageEnglish
Title of host publicationReliable Software Technologies – Ada-Europe 2016 - 21st Ada-Europe International Conference on Reliable Software Technologies, Proceedings
EditorsLuís Miguel Pinho, Eduardo Quiñones, Marko Bertogna
PublisherSpringer Verlag
Pages15-29
Number of pages15
ISBN (Print)9783319390826
DOIs
StatePublished - 2016
Externally publishedYes
Event21st Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2016 - Pisa, Italy
Duration: 13 Jun 201617 Jun 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9695
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2016
Country/TerritoryItaly
CityPisa
Period13/06/1617/06/16

Keywords

  • Buffer boundedness
  • Data flow graphs
  • Real-time task models
  • Schedulability analysis

Fingerprint

Dive into the research topics of 'Modeling and analysis of data flow graphs using the digraph real-time task model'. Together they form a unique fingerprint.

Cite this