Windowed Data Flow (WDF)
Modern image processing applications not only induce huge computational load but also are characterized by increasing complexity. As exemplarily shown in Section 2.2, they typically consist of a mixture of static and data-dependent algorithms and operate on both one-dimensional and multidimensional streams of data. Efficient implementation is only possible by exploiting different kinds of parallelism, namely task, data, and operation-level parallelism (see Section 2.5). Out-of-order communication and sliding windows with parallel data access require complex communication synthesis.
KeywordsSeed Image Read Operation Data Flow Graph System Level Design Virtual Token
- 50.Buck, J.T.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Ph.D. thesis, University of California at Berkeley (1993)Google Scholar
- 152.ISO/IEC JTC1/SC29/WG1: JPEG2000 Part I Final Committee Draft Version 1.0 (2002). N1646RGoogle Scholar
- 165.Keinert, J., Haubelt, C., Teich, J.: Windowed Synchronous Data Flow (WSDF). Tech. Rep. 02-2005, University of Erlangen-Nuremberg, Institut for Hardware-Software-Co-Design (2005)Google Scholar
- 166.Keinert, J., Haubelt, C., Teich, J.: Modeling and analysis of windowed synchronous algorithms. ICASSP2006 III, 892–895 (2006)Google Scholar
- 312.Zebelein, C., Falk, J., Haubelt, C., Teich, J.: Classification of general data flow actors into known models of computation. In: Proc. 6th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2008), pp. 119–128. Anaheim, CA (2008)Google Scholar