E. De-greef, F. Catthoor, and H. De-man, Array placement for storage size reduction in embedded multimedia systems Application-Specific Systems, Architectures and Processors, IEEE International Conference on, p.66, 1997.

P. Murthy and S. Bhattacharyya, Shared memory implementations of synchronous dataflow specifications, Design, Automation and Test in Europe Conference and Exhibition 2000. Proceedings, pp.404-410, 2000.

J. Fabri, Automatic storage optimization, 1979.
DOI : 10.1145/800229.806957

M. Raulet, Optimisations mémoire dans la méthodologie aaa pour code embarqué sur architecturesparalì eles, 2006.

E. A. Lee and T. M. Parks, Dataflow process networks, Proceedings of the IEEE, pp.773-801, 1995.
DOI : 10.1109/5.381846
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.2539

J. Piat, S. S. Bhattacharyya, M. Pelcat, and M. Raulet, Multi-core code generation from interface based hierarchy, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00440479

M. Pelcat, J. Piat, M. Wipliez, J. F. Nezan, and S. Aridhi, An Open Framework for Rapid Prototyping of Signal Processing Applications, EURASIP Journal on Embedded Systems, vol.75, issue.9, 2009.
DOI : 10.1109/78.295199
URL : https://hal.archives-ouvertes.fr/hal-00429312

M. Pelcat, J. F. Nezan, J. Piat, J. Croizer, and S. Aridhi, A System-Level architecture model for rapid prototyping of heterogeneous multicore embedded systems, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00429397

M. Pelcat, Rapid prototyping and dataflow-based code generation for the 3gpp lte enodeb physical layer mapped onto multi-core dsps, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00578043

J. Boutellier, Quasi-static scheduling for fine-grained embedded multiprocessing, 2009.

E. Lee and D. Messerschmitt, Synchronous data flow, Proceedings of the IEEE, vol.75, issue.9, pp.1235-1245, 1987.
DOI : 10.1109/PROC.1987.13876

S. Sriram and S. S. Bhattacharyya, Embedded Multiprocessors: Scheduling and Synchronization, 2009.
DOI : 10.1201/9781420048025

W. Sung and S. Ha, Memory efficient software synthesis with mixed coding style from dataflow graphs Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, vol.8, issue.5, pp.522-526, 2000.

Y. Kwok, High-performance algorithms of compile-time scheduling of parallel processors, 1997.

M. Bouchard, M. Angalovi´cangalovi´c, A. Hertz, and P. R. Ostergård, About equivalent interval colorings of weighted graphs A new algorithm for the maximum-weight clique problem, Discrete Appl. Math. Nordic J. of Computing, vol.15716, issue.8, pp.3615-3624, 2001.

K. Yamaguchi and S. Masuda, A new exact algorithm for the maximum weight clique problem, 23rd International Conference on Circuit/Systems, Computers and Communications (ITC-CSCC'08), 2008.

J. T. Kim and D. R. Shin, New efficient clique partitioning algorithms for register-transfer synthesis of data paths, Journal of the Korean Phys. Soc, vol.40, p.2002, 2002.

R. Szymanek and K. Kuchcinski, A constructive algorithm for memoryaware task assignment and scheduling, Proceedings of the ninth international symposium on Hardware/software codesign, ser. CODES '01, pp.147-152, 2001.

H. Orsila, T. Kangas, E. Salminen, T. D. Hämäläinen, and M. Hännikäinen, Automated memory-aware application distribution for Multi-processor System-on-Chips, Journal of Systems Architecture, vol.53, issue.11, pp.795-815, 2007.
DOI : 10.1016/j.sysarc.2007.01.013

F. Balasa, P. Kjeldsberg, A. Vandecappelle, M. Palkovic, Q. Hu et al., Storage Estimation and Design Space Exploration Methodologies for the Memory Management of Signal Processing Applications, Journal of Signal Processing Systems, vol.2, issue.1, pp.51-71, 2008.
DOI : 10.1007/s11265-008-0244-0