Advertisement

Data Flow Modeling and Implementation

  • Patrick R. Schaumont
Chapter

Abstract

In this chapter, we will learn how to create data flow models, and how to implement those models in hardware and software. Unlike C programs, data flow models are concurrent: they can express activities that happen simultaneously. This property makes data flow well suited for a parallel hardware implementation as well as a sequential software implementation.

Keywords

Data Flow Actor Firing FIFO Queue Input Queue Firing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Buck JT (1993) Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Ph.D. Dissertation, UCB/ERL 93/63, UC Berkeley, CAGoogle Scholar
  2. Dennis J (2007) A dataflow retrospective - how it all began. http://csg.csail.mit.edu/Dataflow/talks/DennisTalk.pdf
  3. Eker J, Janneck J, Lee E, Liu J, Liu X, Ludvig J, Neuendorffer S, Sachs S, Xiong Y (2003) Taming heterogeneity - the ptolemy approach. Proceedings of the IEEE 91(1):127–144CrossRefGoogle Scholar
  4. Lee EA, Messerschmitt DG (1987) Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans Computers 36(1):24–35MATHCrossRefGoogle Scholar
  5. Parhi KK, Messerschmitt DG (1989) Fully-static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. In: ICPP (1), pp 209–216Google Scholar
  6. Stanford Graphics Lab (2003) Brook language. Http://graphics.stanford.edu/projects/brookgpu/ lang.htmlGoogle Scholar
  7. Thies W (2008) Language and compiler support for stream programs. PhD thesis, MIT, http://groups.csail.mit.edu/cag/streamit/shtml/documentation.shtml

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Bradley Dept. Electrical & Computer EngineeringVirginia TechBlacksburgUSA

Personalised recommendations