B. Bhattacharya and S. S. Bhattacharyya, Parameterized dataow modeling of DSP systems, ICASSP'00. IEEE, 2000.

S. S. Bhattacharyya, G. Brebner, J. W. Janneck, J. Eker, C. Von-platen et al., OpenDF, ACM SIGARCH Computer Architecture News, vol.36, issue.5, p.2935, 2009.
DOI : 10.1145/1556444.1556449
URL : https://hal.archives-ouvertes.fr/hal-00398827

S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee, Software Synthesis from Dataow Graphs, 1996.

J. Buck and E. Lee, Scheduling dynamic data-ow graphs with bounded memory using the token ow model, ICASSP'93, pp.429-432, 1993.

M. Geilen and T. Basten, Requirements on the Execution of Kahn Process Networks, ESOP'03, p.319334, 2003.
DOI : 10.1007/3-540-36575-3_22

G. Kahn, The semantics of a simple language for parallel programming, Information processing, p.471475, 1974.

E. Lee and D. Messerschmitt, Static scheduling of synchronous data ow programs for digital signal processing, IEEE Trans. Comput, vol.36, issue.1, p.2435, 1987.

S. Neuendorer and E. Lee, Hierarchical reconguration of dataow models, MEMOCODE'04, p.179188, 2004.

T. M. Parks, Bounded Scheduling of Process Networks, 1995.

S. Stuijk, M. Geilen, B. Theelen, and T. Basten, Scenario-aware dataow: Modeling, analysis and implementation of dynamic applications, IC- SAMOS'11, p.404411, 2011.

M. Wiggers, M. Bekooij, and G. Smit, Buer capacity computation for throughput constrained streaming applications with data-dependent intertask communication, RTAS'08, p.183194, 2008.