Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00229633" target="_blank" >RIV/68407700:21230/15:00229633 - isvavai.cz</a>

Result on the web

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7092796&isnumber=7092002" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7092796&isnumber=7092002</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/PDP.2015.57" target="_blank" >10.1109/PDP.2015.57</a>

Result language

angličtina

Original language name

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

Original language description

Many embedded multi-core systems incorporate both dataflow applications with timing constraints and traditional real-time applications. Applying real-time scheduling techniques on such systems provides real-time guarantees that all running applications will execute safely without violating their deadlines. However, to apply traditional real-time scheduling techniques on such mixed systems, a unified model to represent both types of applications running on the system is required. Several earlier works have addressed this problem and solutions have been proposed that address acyclic graphs, implicit-deadline models or are able to extract timing parameters considering specific scheduling algorithms. In this paper, we present an algorithm for extracting real-time parameters (offsets, deadlines and periods) that are independent of the schedulability analysis, other applications running in the system, and the specific platform. The proposed algorithm: 1) enables applying traditional real-time schedulers and analysis techniques on cyclic or acyclic Homogeneous Synchronous Dataflow (HSDF) applications with periodic sources, 2) captures overlapping iterations, which is a main characteristic of the execution of dataflow applications, 3) provides a method to assign offsets and individual deadlines for HSDF actors, and 4) is compatible with widely used deadline assignment techniques, such as NORM and PURE. The paper proves the correctness of the proposed algorithm through formal proofs and examples.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/EE2.3.30.0034" target="_blank" >EE2.3.30.0034: Support of inter-sectoral mobility and quality enhancement of research teams at Czech Technical University in Prague</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Parallel, Distributed and Network-Based Processing - proceedings

ISBN

978-1-4799-8490-9

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

701-710

Publisher name

IEEE

Place of publication

Piscataway

Event location

Turku

Event date

Mar 4, 2015

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000380471500105