Abstract
In the previous chapters, we justified our choice for data flow as the basis of a model of computation for embedded real-time streaming applications running on a multiprocessor. There are many flavors of data flow. The ones that are interesting for our stated goals are mostly the variants that exhibit behavior which is independent of data values, because of their analytical properties and the variants with deterministic, data value dependent behavior, because of their expressivity. In this chapter, we present notation for data flow models that we will use throughout the book, and the properties of several data flow computation models that are relevant to our stated goal. This is reference material. It can, for the most, be found elsewhere in the literature [10, 57, 80, 81].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
F. Baccelli, G. Cohen, G. Olsder, and J.-P. Quadrat. Synchronization and Linearity. John Wiley & Sons, Inc., 1992.
G. Bilsen et al. Cyclo-static dataflow. IEEE Transactions on Signal Processing, 44(2):397–408, 1996.
J. Buck. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD thesis, Univ. of California, Berkeley, September 1993.
A. Dasdan. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems, 9(4):385–418, Oct. 2004.
E. Lee and D. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. In IEEE Transactions on Computers, 1987.
E. Lee and D. Messerschmitt. Synchronous data flow. In Proceedings of the IEEE, 1987.
T. Miyazaki and E. Lee. Code generation by using integer-controlled data flow graph. In Proc. ICASSP, 1997.
P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, and B. Mesman. Task-level timing models for guaranteed performance in multiprocessor networks-on-chip. In Proc. Int’l Conf. on Compilers, Architectures and Synthesis for Embedded Systems (CASES), pages 63–72, 2003.
R. Reiter. Scheduling parallel computations. Journal of the ACM, 15(4):590–599, October 1968.
S. Sriram and S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker Inc., 2000.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Moreira, O., Corporaal, H. (2014). Data Flow Computation Models. In: Scheduling Real-Time Streaming Applications onto an Embedded Multiprocessor. Embedded Systems, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-319-01246-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-01246-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01245-2
Online ISBN: 978-3-319-01246-9
eBook Packages: EngineeringEngineering (R0)