2010 10th International Conference on Application of Concurrency to System Design (2006)

Turku, Finland

June 28, 2006 to June 30, 2006

ISSN: 1550-4808

ISBN: 0-7695-2556-3

pp: 25-36

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSD.2006.33

A.H. Ghamarian , Eindhoven University of Technology

T. Basten , Eindhoven University of Technology

M.J.G. Bekooij , Philips Research Laboratories Eindhoven

B.D. Theelen , Eindhoven University of Technology

S. Stuijk , Eindhoven University of Technology

A.J.M. Moonen , Philips Research Laboratories Eindhoven

M.R. Mousavi , Eindhoven University of Technology

M.C.W. Geilen , Eindhoven University of Technology

ABSTRACT

Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for application mapping on platforms. Throughput analysis of these SDFGs is an important step for verifying throughput requirements of concurrent real-time applications, for instance within design-space exploration activities. Analysis of SDFGs can be hard, since the worst-case complexity of analysis algorithms is often high. This is also true for throughput analysis. In particular, many algorithms involve a conversion to another kind of data flow graph, the size of which can be exponentially larger than the size of the original graph. In this paper, we present a method for throughput analysis of SDFGs, based on explicit state-space exploration and we show that the method, despite its worst-case complexity, works well in practice, while existing methods often fail. We demonstrate this by comparing the method with state-ofthe- art cycle mean computation algorithms. Moreover, since the state-space exploration method is essentially the same as simulation of the graph, the results of this paper can be easily obtained as a byproduct in existing simulation tools.

INDEX TERMS

null

CITATION

A.H. Ghamarian,
T. Basten,
M.J.G. Bekooij,
B.D. Theelen,
S. Stuijk,
A.J.M. Moonen,
M.R. Mousavi,
M.C.W. Geilen,
"Throughput Analysis of Synchronous Data Flow Graphs",

*2010 10th International Conference on Application of Concurrency to System Design*, vol. 00, no. , pp. 25-36, 2006, doi:10.1109/ACSD.2006.33SEARCH