Performance analysis of weakly-consistent scenario-aware dataflow graphs
conference paper
The timed dataflow model of computation is a useful performance analysis tool for Electronic System Level Design automation and embedded software synthesis. Its determinism gives it strong analysability properties. It is expressive enough to cover a large class of applications and platforms. The trend however, in both embedded applications and their platforms is to become more dynamic, reaching the limits of what the model can express and analyse with tight performance guarantees. Scenario-aware dataflow (SADF) allows more dynamism to be expressed, introducing a controlled amount of non-determinism into the model to represent different scenarios of behaviour. We investigate so-called weakly consistent graphs in which the scenario changes are not tightly coupled with periods of repetitive behaviour of the static dataflow behaviour in scenarios as in previous methods. We define the semantics of such graphs in terms of (max, +)-algebra and we introduce a method to analyse throughput using a generalisation of (max, +)-automata. An extended version of this paper can be found in [15]. © 2014 IEEE.
Topics
TNO Identifier
527983
ISSN
10586393
ISBN
9781479982974
Publisher
IEEE Computer Society
Article nr.
7094470
Source title
48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015; Asilomar Hotel and Conference GroundsPacific Grove; United States; 2 November 2014 through 5 November 2014
Editor(s)
Matthews M.B.
Pages
393-397
Files
To receive the publication files, please send an e-mail request to TNO Repository.