Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multi-processor platforms. One of the most prominent performance constraints of concurrent real-time applications is throughput. For given actor execution times, throughput can be verified by analyzing the SDFG models of such applications, for instance using maximum cycle mean analysis or state space analysis. In various contexts, such as design space exploration or run-time reconfiguration, many fast throughput computations are required for varying actor execution times.
We present methods to compute throughput of an SDFG where actor execution times can be parameters. The throughput of these graphs is obtained in the form of a function of these parameters. Recalculation of throughput is then merely an evaluation of this function for specific parameter values, which is much faster than the standard throughput analysis. We propose three different algorithms for parametric throughput analysis and evaluate these algorithms experimentally, showing the feasibility of the approach and showing that a divide and conquer algorithm performs best.
- Parametric Throughput Analysis of Synchronous Data Flow Graphs
A.H. Ghamarian, M.C.W. Geilen, T. Basten and S. Stuijk.
In Design, Automation and Test in Europe, DATE 08, Proceedings, pages 116-121. Munich, Germany, 10-14 March, 2008. IEEE Computer Society Press, Los Alamitos, CA, USA, 2008. (abstract, pdf, doi).