Resource-Constrained Optimal Scheduling of Synchronous Dataflow Graphs via Timed Automata

Abstract

Synchronous dataow (SDF) graphs are a widely used formalism for modelling, analysing and realising streaming applications, both on a single processor and a multiprocessing context. Ecient schedules are necessary to obtain maximal throughput with the optimum energy consumption in such a way that the number of resources used to run these applications is kept as low a possible. This paper presents an approach of scheduling SDF graphs using a proven formalism for timed systems called timed automata (TA). TA holds a good balance between the expressiveness and tractability, and are supported by many verication tools e.g. Kronos and Uppaal. We describe an algorithm for the compositional translation of SDF graphs to TA and implementation of the translation to analyse and verify SDF graphs in state-of-the-art tool Uppaal. This approach does not require any transformation of SDF graphs to HSDF graphs and helps to nd the schedules with a best compromise between number of the processors required and the throughput. It also allows quantitative model checking and verication of the user-dened properties like absence of deadlocks, safety, liveness and throughput analysis. The translation also forms the basis for future work of extending SDF graphs with the new features, e.g. stochastics, energy consumption and costs. This work also strives for bridging and extending the modelling computational formalisms towards energy aspects of self supporting computation. * This research has been supported by the EU FP7 project named SENSATION.

State-based real-time analysis of SDF applications on MPSoCs with shared communication resources

“…Nevertheless, it does not consider a shared communication resource. A more recent work [21] followed the same path of our work, presenting a translation of single SDFGs to timed-automata templates in order to analyse their behavior using model-checking. In contrast to our work, they focused on finding a maximal throughput on a given number of processors.…”

Low Power Gated-Clock Design for Multi-core DSP Based SDR Platform

“…According to different processing purposes baseband digital signal processing can be divided into three parts, which are digital frontend, modem, and codec. The current popular wireless communication standards, such as WLAN, WiMAX, etc., are data-stream dominant and has synchronous data flow characteristic in digital processing [15][16]. …”

Modeling resource sharing using FSM-SADF

“…In [1], a modeling approach to find the maximal throughput for the problem of scheduling of SDFGs by converting the graph into a Timed Automata [2] model is presented. In contrast to our approach, it relies on a transformation of dataflow models to other models of computation for the analysis.…”

“…In this paper 1 we present a modeling approach based on Scenario-Aware Dataflow (SADF) that provides a single, compact and formal model of the system which reflects the complete state-space for all binding and scheduling options of an application to be mapped on a given platform. Our approach allows for the modeling of both application and platform constraints, keeping all deterministic behavior of the application within static dataflow graphs and model explicitly the different choices of scheduling and binding decisions in a Finite-State Machine.…”

“…The approach uses a rich formalism capable of capturing different applications or different levels of application pipelining. The resulting model uses an underlying symbolic executable flow to analyze the performance or 1 The extended version of this paper can be found in [3] specific scenario sequences or perform state-space exploration for timing analysis.…”