Throughput Analysis of Synchronous Data Flow Graphs

  • Authors:

  • A. H. Ghamarian;M. C. W. Geilen;S. Stuijk;T. Basten;B. D. Theelen;M. R. Mousavi;A. J. M. Moonen;M. J. G. Bekooij

  • Affiliations:

  • Eindhoven University of Technology;Eindhoven University of Technology;Eindhoven University of Technology;Eindhoven University of Technology;Eindhoven University of Technology;Eindhoven University of Technology;Philips Research Laboratories Eindhoven;Philips Research Laboratories Eindhoven

  • Venue:
  • ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.