Data Flow Modeling and Implementation
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.
KeywordsData Flow Actor Firing FIFO Queue Input Queue Firing Rule
- 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
- Dennis J (2007) A dataflow retrospective - how it all began. http://csg.csail.mit.edu/Dataflow/talks/DennisTalk.pdf
- 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
- Stanford Graphics Lab (2003) Brook language. Http://graphics.stanford.edu/projects/brookgpu/ lang.htmlGoogle Scholar
- Thies W (2008) Language and compiler support for stream programs. PhD thesis, MIT, http://groups.csail.mit.edu/cag/streamit/shtml/documentation.shtml