Skip to main content

Data Flow Computation Models

  • Chapter
  • First Online:
  • 1095 Accesses

Part of the book series: Embedded Systems ((EMSY,volume 24))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Bibliography

  1. F. Baccelli, G. Cohen, G. Olsder, and J.-P. Quadrat. Synchronization and Linearity. John Wiley & Sons, Inc., 1992.

    MATH  Google Scholar 

  2. G. Bilsen et al. Cyclo-static dataflow. IEEE Transactions on Signal Processing, 44(2):397–408, 1996.

    Article  Google Scholar 

  3. J. Buck. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD thesis, Univ. of California, Berkeley, September 1993.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. E. Lee and D. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. In IEEE Transactions on Computers, 1987.

    Google Scholar 

  6. E. Lee and D. Messerschmitt. Synchronous data flow. In Proceedings of the IEEE, 1987.

    Google Scholar 

  7. T. Miyazaki and E. Lee. Code generation by using integer-controlled data flow graph. In Proc. ICASSP, 1997.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. R. Reiter. Scheduling parallel computations. Journal of the ACM, 15(4):590–599, October 1968.

    Article  MATH  Google Scholar 

  10. S. Sriram and S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker Inc., 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics