Due to its complexity, the problem of mapping and scheduling streaming applications on
heterogeneous MPSoCs under real-time and performance constraints has traditionally been …

System level optimization for multiple mixed-criticality applications on shared networked
multiprocessor platforms is extremely challenging. Substantial complexity arises from the …

When designing complex mixed-critical systems on multiprocessor platforms, a huge
number of design alternatives has to be evaluated. Therefore, there is a need for tools which …

In this paper, we present a transformation that takes a cyclo-static dataflow (CSDF) graph
and produces an equivalent multi-rate synchronous dataflow (MRSDF) graph. This fills a …

Real-time stream processing applications executed on embedded multiprocessor systems
often have strict throughput and latency constraints. Violating these constraints is undesired …

Exact analysis of synchronous dataflow (sdf) graphs is often considered too costly, because
of the expensive transformation of the graph into a single-rate equivalent. As an alternative …

Real-time stream processing applications such as software defined radios are usually
executed concurrently on multiprocessor systems. Exploiting coarse-grained data …

Abstract Synchronous DataFlow Graph (SDFG in short) is a formalism frequently considered
in electronic design and software compilers to model communications between components …

In this article, we present a mathematical characterisation of admissible schedules of cyclo-
static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this …

Efficient analysis techniques for hsdf graphs exist; a graph's throughput and the associated
static schedule may be computed in polynomial time [Dasdan 2004]. These techniques can …