research-article

Single-rate approximations of cyclo-static synchronous dataflow graphs

Authors:

Robert de Groote,

Philip K. F. Hölzenspies,

Gerard J. M. SmitAuthors Info & Claims

SCOPES '14: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

Pages 11 - 20

https://doi.org/10.1145/2609248.2609249

Published: 10 June 2014 Publication History

Abstract

Exact analysis of synchronous dataflow (sdf) graphs is often considered too costly, because of the expensive transformation of the graph into a single-rate equivalent. As an alternative, several authors have proposed approximate analyses. Existing approaches to approximation are based on the operational semantics of an sdf graph.

We propose an approach to approximation that is based on functional semantics. This generalises earlier work done on multi-rate sdf graphs towards cyclo-static sdf (csdf) graphs. We take, as a starting point, a mathematical characterisation, and derive two transformations of a csdf graph into hsdf graphs. These hsdf graphs have the same size as the csdf graph, and are approximations: their respective temporal behaviours are optimistic and pessimistic with respect to the temporal behaviour of the csdf graph. Analysis results computed for these single-rate approximations give bounds on the analysis results of the csdf graph. As an illustration, we show how these single-rate approximations may be used to compute bounds on the buffer sizes required to reach a given throughput.

References

[1]

M. Benazouz and A. Munier-Kordon. Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization. In Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems (M-SCOPES), pages 3--12, New York, NY, USA, June 2013. ACM Press.

Digital Library

[2]

G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. Cyclo-Static dataflow. IEEE Transactions on Signal Processing, 44(2):397--408, 1996.

Digital Library

[3]

G. Cohen, S. Gaubcrt, and J. Quadrat. Timed-event graphs with multipliers and homogeneous min-plus systems. IEEE Transactions on Automatic Control, 43(9): 1296--1302, 1998.

[4]

G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and linearity. Wiley New York, 1992.

[5]

A. Dasdan. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems (TODAES), 9(4):385--418, 2004.

Digital Library

[6]

R. de Groote, P. K. F. Hölzenspies, J. Kuper, and H. J. Broersma. Back to Basics: Homogeneous Representations of Multi-Rate Synchronous Dataflow Graphs. In Proceedings of the 11th AGM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE), pages 35--46, Oct. 2013.

[7]

R. de Groote, P. K. F. Hölzenspies, J. Kuper, and G. J. M. Smit. Multirate Equivalents of Cyclo-Static Synchronous Dataflow Graphs. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD), June 2014. to appear.

[8]

R. de Groote, J. Kuper, H. Broersma, and G. J. Smit. Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs. In Proceedings of the 38th Euromicro Conference on Software Engineering and Advanced Applications (SEAA), pages 29--38. IEEE, Sept. 2012.

Digital Library

[9]

A. H. Ghamarian, M. Geilen, T. Basten, B. D. Theelen, M. R. Mousavi, and S. Stuijk. Liveness and Boundedness of Synchronous Data Flow Graphs. In Proceedings of the 6th International Conference on Formal Methods in Computer Aided Design (FMCAD), pages 68--75. IEEE, Aug. 2006.

Digital Library

[10]

A. H. Ghamarian, M. C. W. Geilen, S. Stuijk, T. Basten, B. D. Theelen, M. R. Mousavi, A. J. M. Moonen, and M. J. G. Bekooij. Throughput Analysis of Synchronous Data Flow Graphs. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD), pages 25--36. IEEE, June 2006.

Digital Library

[11]

J. P. Hausmans, S. J. Geuns, M. H. Wiggers, and M. J. Bekooij. Compositional temporal analysis model for incremental hard real-time system design. In Proceedings of the 10th ACM International Conference on Embedded Software (EMSOFT), pages 185--194, New York, NY, USA, Oct. 2012. ACM Press.

Digital Library

[12]

B. Heidergott, G. J. Olsder, and J. van der Woude. Max Plus at Work: modeling and analysis of synchronized systems. Princeton University Press, 2006.

[13]

E. Lee and D. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9):1235--1245, 1987.

[14]

E. Lee and T. Parks. Dataflow process networks. Proceedings of the IEEE, 83(5):773--801, May 1995.

[15]

A. Moonen, M. Bekooij, R. van den Berg, and J. van Meerbergen. Practical and Accurate Throughput Analysis with the Cyclo Static Dataflow Model. In Proceedings of the 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 238--245. IEEE, Oct. 2007.

Digital Library

[16]

R. Reiter. Scheduling Parallel Computations. Journal of the ACM, 15(4):590--599, Oct. 1968.

Digital Library

[17]

S. Stuijk, M. Geilen, and T. Basten. Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs. IEEE Transactions on Computers, 57(10):1331--1345, Oct. 2008.

Digital Library

[18]

S. Stuijk, M. C. W. Geilen, and T. Basten. SDF³: SDF For Free. In Proceedings of the 6th International Conference on Application of Concurrency to System Design, pages 276--278. IEEE Computer Society Press, Los Alamitos, CA, USA, June 2006.

Digital Library

[19]

E. Teruel, P. Chrzastowski-Wachtel, J. M. Colom, and M. Silva. On Weighted T-Systems. Lecture Notes In Computer Science; Vol. 616, page 348, 1992.

Digital Library

[20]

M. Wiggers, M. Bekooij, and G. Smit. Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs. In Proceedings of the 44th ACM/IEEE Design Automation Conference (DAC), pages 658--663. IEEE, June 2007.

Digital Library

[21]

M. H. Wiggers. Aperiodic Multiprocessor Scheduling for Real-Time Stream Processing Applications. PhD thesis, University of Twente, Enschede, The Netherlands, June 2009.

Cited By

Ara HBehrouzian AHendriks MGeilen MGoswami DBasten T(2018)Scalable Analysis for Multi-Scale Dataflow ModelsACM Transactions on Embedded Computing Systems10.1145/323318317:4(1-26)Online publication date: 25-Aug-2018
https://dl.acm.org/doi/10.1145/3233183
Groote R(2018)Throughput analysis of dataflow graphsHandbook of Signal Processing Systems10.1007/978-3-319-91734-4_21(751-786)Online publication date: 14-Oct-2018
https://doi.org/10.1007/978-3-319-91734-4_21
Groote RHölzenspies PKuper JSmit G(2015)Incremental Analysis of Cyclo-Static Synchronous Dataflow GraphsACM Transactions on Embedded Computing Systems10.1145/279298114:4(1-26)Online publication date: 8-Dec-2015
https://dl.acm.org/doi/10.1145/2792981

Index Terms

Single-rate approximations of cyclo-static synchronous dataflow graphs
1. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

Multi-rate Equivalents of Cyclo-Static Synchronous Dataflow Graphs
ACSD '14: Proceedings of the 2014 14th International Conference on Application of Concurrency to System Design

In this paper, we present a transformation that takes a cyclo-static dataflow (CSDF) graph and produces an equivalent multi-rate synchronous dataflow (MRSDF) graph. This fills a gap in existing analysis techniques for synchronous dataflow graphs, ...
Incremental Analysis of Cyclo-Static Synchronous Dataflow Graphs

In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation ...
A comparison of synchronous and cycle-static dataflow
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)

We compare synchronous dataflow (SDF) and cyclo-static dataflow (CSDF), which are each special cases of a model of computation we call dataflow process networks. In SDF actors have static firing rules: they consume and produce a fixed number of data ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

SCOPES '14: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

June 2014

162 pages

ISBN:9781450329415

DOI:10.1145/2609248

General Chair:
Henk Corporaal
Eindhoven University of Technology, NL
,
Program Chair:
Sander Stuijk
Eindhoven University of Technology, NL

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

EDAA: European Design Automation Association

In-Cooperation

SIGBED: ACM Special Interest Group on Embedded Systems

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Seventh Framework Programme

Conference

SCOPES '14

Sponsor:

EDAA

SCOPES '14: 17th International Workshop on Software and Compilers for Embedded Systems

June 10 - 11, 2014

Sankt Goar, Germany

Acceptance Rates

Overall Acceptance Rate 38 of 79 submissions, 48%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
91
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ara HBehrouzian AHendriks MGeilen MGoswami DBasten T(2018)Scalable Analysis for Multi-Scale Dataflow ModelsACM Transactions on Embedded Computing Systems10.1145/323318317:4(1-26)Online publication date: 25-Aug-2018
https://dl.acm.org/doi/10.1145/3233183
Groote R(2018)Throughput analysis of dataflow graphsHandbook of Signal Processing Systems10.1007/978-3-319-91734-4_21(751-786)Online publication date: 14-Oct-2018
https://doi.org/10.1007/978-3-319-91734-4_21
Groote RHölzenspies PKuper JSmit G(2015)Incremental Analysis of Cyclo-Static Synchronous Dataflow GraphsACM Transactions on Embedded Computing Systems10.1145/279298114:4(1-26)Online publication date: 8-Dec-2015
https://dl.acm.org/doi/10.1145/2792981

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents