On the hard-real-time scheduling of embedded streaming applications
MA Bamakhrama, TP Stefanov - Design Automation for Embedded …, 2013 - Springer
In this paper, we consider the problem of hard-real-time (HRT) multiprocessor scheduling of
embedded streaming applications modeled as acyclic dataflow graphs. Most of the hard-real …
embedded streaming applications modeled as acyclic dataflow graphs. Most of the hard-real …
ADFG: a scheduling synthesis tool for dataflow graphs in real-time systems
This paper presents a synthesis tool of real-time system scheduling parameters: ADFG
computes task periods and buffer sizes of systems as signal processing applications …
computes task periods and buffer sizes of systems as signal processing applications …
Towards probabilistic timing analysis for SDFGs on tile based heterogeneous MPSoCs
Performance and timing prediction of complex parallel data flow applications on multi-core
systems is still a very difficult discipline. The reason for it comes from the complexity of the …
systems is still a very difficult discipline. The reason for it comes from the complexity of the …
Pareto optimal scheduling for synchronous data flow graphs on heterogeneous multiprocessor
Streaming applications usually run on heterogeneous multiprocessor platforms and are
required to have a high throughput, which in turn may increase the energy consumption. A …
required to have a high throughput, which in turn may increase the energy consumption. A …
Timing analysis of process graphs with finite communication buffers
Real-Time Calculus (RTC) is a modular performance analysis framework for real-time
embedded systems. It can be used to compute the worst-case and best-case response times …
embedded systems. It can be used to compute the worst-case and best-case response times …
Global EDF-based scheduling of multiple independent synchronous dataflow graphs
The global scheduling of systems that can be modeled as collections of multiple
independent recurrent real-time tasks, each represented as a synchronous dataflow graph …
independent recurrent real-time tasks, each represented as a synchronous dataflow graph …
Symbolic analysis of dataflow graphs (extended version)
A Bouakaz, P Fradet, A Girault - 2016 - inria.hal.science
The synchronous dataflow model is widely used to design embedded stream-processing
applications under strict quality-of-service requirements (eg, buffering memory, throughput …
applications under strict quality-of-service requirements (eg, buffering memory, throughput …
An efficient timing model for hardware implementation of multirate dataflow graphs
N Chandrachoodan… - … on Acoustics, Speech …, 2001 - ieeexplore.ieee.org
We consider the problem of representing timing information associated with functions in a
dataflow graph used to represent a signal processing system in the context of high-level …
dataflow graph used to represent a signal processing system in the context of high-level …
Energy-aware scheduling for acyclic synchronous data flows on multiprocessors
Synchronous Data Flow (SDF) is a useful computational model in image processing,
computer vision, and DSP. Previously, throughput and buffer requirement analyses have …
computer vision, and DSP. Previously, throughput and buffer requirement analyses have …
Response time analysis of parallel real-time dag tasks scheduled by thread pools
M Schmid, J Mottok - Proceedings of the 29th International Conference …, 2021 - dl.acm.org
Modern high-end embedded systems nowadays have to process enormous amounts of
data. In order to speed up the computations and fully exploit the resources of the underlying …
data. In order to speed up the computations and fully exploit the resources of the underlying …