P. Mu, M. Raulet, J. Nezan, and J. Cousin, Automatic Code Generation for Multi-MicroBlaze System with SynDEx, 15th European Signal Processing Conference, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00171790

J. Piat and M. Raulet, Maxime Pelcat, Pengcheng Mu and Olivier Déforges . An Extensible Framework for Fast Prototyping of Multiprocessor Dataflow Applications, IDT'08: Proceedings of the 3rd International Design and Test Workshop, 2008.

P. Mu, J. Cousin, J. Nezan, and M. Raulet, Heuristique statique améliorée d'ordonnancement de tâches : impact sur le tri des tâches et sur l'allocation de processeur, XXII e Colloque GRETSI, 2009.

P. Mu, J. Nezan, M. Raulet, and J. Cousin, A List Scheduling Heuristic with New Node Priorities and Critical Child Technique for Task Scheduling with Communication Contention, DASIP 2009: Conference on Design and Architectures for Signal and Image Processing, 2009.
DOI : 10.1007/978-90-481-9965-5_10
URL : https://hal.archives-ouvertes.fr/hal-00566153

P. Mu, J. Nezan, J. Cousin, and M. Raulet, A Dynamic List Scheduling Heuristic with Communication Contention in Parallel Embedded Systems: New Node Priorities, Critical Child and Communica- 144 personal publications tion Delay, EMSOFT 2009: International Conference on Embedded Software, 2009.

T. L. Adam, K. M. Chandy, and J. R. Dickson, A comparison of list schedules for parallel processing systems, Communications of the ACM, vol.17, issue.12, pp.685-690, 1974.
DOI : 10.1145/361604.361619

I. Ahmad and Y. Kwong-kwok, On exploiting task duplication in parallel program scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.9, pp.872-892, 1998.
DOI : 10.1109/71.722221

[. Beaumont, V. Boudet, and Y. Robert, A realistic model and an efficient heuristic for scheduling with heterogeneous processors, Proceedings 16th International Parallel and Distributed Processing Symposium, pp.37-62, 2002.
DOI : 10.1109/IPDPS.2002.1015663
URL : https://hal.archives-ouvertes.fr/hal-00807411

K. Blazewicz, E. Ecker, G. Pesch, J. Schmidt, and . Weglarz, Handbook on Scheduling: From Theory to Applications, p.55, 2007.

[. Bomel, E. Martin, and E. Boutillon, Synchronization Processor Synthesis for Latency Insensitive Systems, Design, Automation and Test in Europe, pp.896-897, 2005.
DOI : 10.1109/DATE.2005.287
URL : https://hal.archives-ouvertes.fr/hal-00077965

P. Brucker, Scheduling Algorithms, p.58, 2007.

J. T. Buck, Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model Scheduling with Small Communication Delays and Task Duplication, OPERATIONS RESEARCH, vol.39, issue.4, pp.33680-684, 1991.

P. Coussy, G. Corre, P. Bomel, E. Senn, and E. Martin, High-level synthesis under I/O Timing and Memory constraints, 2005 IEEE International Symposium on Circuits and Systems, pp.680-683, 2005.
DOI : 10.1109/ISCAS.2005.1464679
URL : https://hal.archives-ouvertes.fr/hal-00077297

F. Cottet, J. Delacroix, C. Kaiser, and Z. Mammeri, Scheduling in Real-Time Systems, p.55, 2002.
DOI : 10.1002/0470856343
URL : https://hal.archives-ouvertes.fr/hal-01125110

E. [. Cirou and . Jeannot, Triplet: A clustering scheduling algorithm for heterogeneous systems, Proceedings International Conference on Parallel Processing Workshops, pp.231-236, 2001.
DOI : 10.1109/ICPPW.2001.951956
URL : https://hal.archives-ouvertes.fr/inria-00100488

E. David, R. M. Culler, D. A. Karp, A. Patterson, K. E. Sahay et al., LogP: Towards a realistic model of parallel computation, Principles Practice of Parallel Programming, pp.1-12, 1993.

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on dis- bibliography 147, p.35, 2001.

G. Corre, E. Senn, P. Bomel, N. Julien, and E. Martin, Memory accesses management during high level synthesis, Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis , CODES+ISSS '04, pp.42-47, 2004.
DOI : 10.1145/1016720.1016733
URL : https://hal.archives-ouvertes.fr/hal-00077355

K. Muhammad, I. Dhodhi, A. Ahmad, I. Yatama, and . Ahmad, An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems, J. Parallel Distrib. Comput, vol.62, issue.9, pp.1338-1361, 2002.

D. Julien, Méthodologie de modélisation et d'exploration d'architecture de réseaux sur puce appliquée aux télécommunications, p.122, 2007.

J. B. Dennis, First version of a data flow procedure language, Proceedings of the Colloque sur la Programmation, pp.362-376, 1974.
DOI : 10.1007/3-540-06859-7_145

[. Diestel, Graph Theory, p.29, 2005.

]. R. Dun90 and . Duncan, A survey of parallel computer architectures, Computer, vol.23, issue.2, pp.5-16, 1990.

[. El-rewini and H. H. Ali, ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS, Parallel Algorithms and Applications, vol.17, issue.3-4, pp.177-191, 1994.
DOI : 10.1016/S0022-0000(75)80008-0

[. El-rewini and M. Adb-el-barr, Advanced Computer Architecture and Parallel Processing, p.29, 2005.
DOI : 10.1002/0471478385

[. El-rewini, T. G. Lewisrewini, T. G. Lewis, and H. H. Ali, Scheduling parallel program tasks onto arbitrary target machines, Journal of Parallel and Distributed Computing, vol.9, issue.2, pp.138-153, 1990.
DOI : 10.1016/0743-7315(90)90042-N

E. Samuel, . J. Fly66-]-m, and . Flynn, Very high-speed computing systems, Proceedings of the IEEE, vol.54, issue.12, pp.1221901-1909, 1966.

[. Fortune, J. Wylliegg69, ]. R. Graham, and R. L. Grahamt, Parallelism in random access machines Bounds on multiprocessing timing anomalies, STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computing, pp.114-118, 1969.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p.58, 1979.

C. [. Grandpierre, Y. Lavarenne, and . Sorel, Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors, Proceedings of the seventh international workshop on Hardware/software codesign , CODES '99, 1999.
DOI : 10.1145/301177.301489
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3154

Y. [. Grandpierre and . Sorel, From algorithm and architecture specifications to automatic generation of distributed real-time executives: a seamless flow of graphs transformations, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings., p.30, 2003.
DOI : 10.1109/MEMCOD.2003.1210097

]. J. Gu93 and . Gu, Local search for satisfiability (sat) problem. Systems, Man and Cybernetics, IEEE Transactions on, vol.23, issue.4, pp.1108-1129, 1993.

T. [. Gerasoulis and . Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.6, pp.686-701, 1993.
DOI : 10.1109/71.242154

J. Hwang, Y. Chow, F. D. Anger, and C. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016

J. Wiley, &. Sons, . Inc, . Hj05-]-t, J. Hagras et al., A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems, Parallel Comput, issue.7, pp.61-31653, 2004.

A. [. Hanen and . Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, Emerging Technologies and Factory Automation ETFA '95, pp.167-189, 1995.
URL : https://hal.archives-ouvertes.fr/hal-01185825

L. John, D. A. Hennessy, and . Patterson, Computer Architecture: A Quantitative Approach. The Morgan Kaufmann Series in Computer Architecture and Design, p.64, 2002.

]. T. Hu61 and . Hu, Parallel Sequencing and Assembly Line Problems, OPERA- TIONS RESEARCH, vol.9, issue.6, pp.841-848, 1961.

W. Jörn and . Janneck, NL -a Network Language, p.17, 2007.

W. Jörn, R. Janneck, and . Esser, A predicate-based approach to defining visual language syntax, Symposium on Visual Languages and Formal Methods, HCC01, Stresa, pp.40-47, 2001.

W. Jörn, I. D. Janneck, D. B. Miller, G. Parlour, M. Roquier et al., Synthesizing hardware from dataflow programs: an mpeg-4 simple profile decoder case study, Signal Processing Systems, p.21, 2008.

[. Kwok and I. Ahmad, Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures, SPDP '95: Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing, pp.36-62, 1995.

[. Kwok, I. Ahmad, Y. Kwok, and I. Ahmad, Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.5, pp.506-521, 1996.
DOI : 10.1109/71.503776

P. Distrib and . Comput, Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, International Conference on Parallel Processing, pp.58-77, 1997.

[. Kwok, I. Amad, and J. Gu, Fast: A low-complexity algorithm for efficient scheduling of dags on parallel processors, Proceedings of the 1996 Internationnal Conference on Parallel Processing, pp.150-157, 1996.

]. G. Kah74 and . Kahn, The semantics of a simple language for parallel programming, Information processing, pp.471-475, 1974.

L. Kaouane, M. Akil, Y. Sorel, and T. Grandpierre, A Methodology to Implement Real-Time Applications onto Reconfigurable Circuits, Proceedings of International Conference on Engineering of Reconfigurable Systems and Algorithms, ERSA'03, p.12, 2003.
DOI : 10.1023/B:SUPE.0000045213.82276.8e

T. [. Kruatrachue and . Lewis, Grain size determination for parallel processing, IEEE Software, vol.5, issue.1, pp.23-32, 1988.
DOI : 10.1109/52.1991

G. Kahn, D. B. Macqueenkn84-]-h, S. Kasahara, and . Narita, Coroutines and networks of parallel processes Practical multiprocessor scheduling algorithms for efficient parallel processing. Computers, Proccedings of the IFIP Congress, pp.993-998, 1977.

T. [. Kon-'ya and . Satoh, Task scheduling on a hypercube with link contentions, Parallel Processing Symposium Proceedings of Seventh International, pp.363-368, 1993.

[. Gal, E. Casseau, S. Huet, P. Bomel, C. Jego et al., C-based rapid prototyping for digital signal processing, Proceedings of 13th European Signal Processing Conference, p.14, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00080466

[. Gal, E. Casseau, S. Huet, and E. Martin, Pipelined memory controllers for DSP applications handling unpredictable data acesses, IEEE Computer Society Annual Symposium on VLSI, pp.268-269, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00080044

A. Edward, D. G. Lee, and . Messerschmitt, Static scheduling of synchronous data flow programs for digital signal processing, IEEE Trans

A. Edward, D. G. Lee, and . Messerschmitt, Synchronous data flow, Proceedings of the IEEE, pp.1235-1245, 1987.

C. Lucarz, M. Mattavelli, J. Thomas-kerr, and J. Janneck, Reconfigurable Media Coding: A New Specification Model for Multimedia Coders, 2007 IEEE Workshop on Signal Processing Systems, pp.481-486, 2007.
DOI : 10.1109/SIPS.2007.4387595

[. Liou, M. A. Palislpx05-]-g, K. L. Liu, M. Poh, and . Xie, A new heuristic for scheduling parallel programs on multiprocessor Iterative list scheduling for heterogeneous computing, PACT '98: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation TechniquesMar06] Grant Martin. Overview of the mpsoc design challenge Proceedings of the 43rd annual conference on Design automation, pp.358-61654, 1998.

C. Mccreary and H. Gill, Automatic determination of grain size for efficient parallel processing, Communications of the ACM, vol.32, issue.9, pp.1073-1078, 1989.
DOI : 10.1145/66451.66454

[. Mehdiratta and K. Ghose, A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors, 1994 International Conference on Parallel Processing (ICPP'94), pp.151-154349, 1994.
DOI : 10.1109/ICPP.1994.14

A. Daniel, D. Menascé, S. C. Saha, V. A. Da-silva-porto, S. K. Almeida et al., Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures, J. Parallel Distrib. Comput, vol.28, issue.1, pp.1-18, 1995.

H. Oh and S. Ha, A static scheduling heuristic for heterogeneous processors Generation of embedded hardware/software from systemc, Euro-Par '96: Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II, pp.573-57719, 1996.

A. Michael, J. Palis, D. S. Liou, and . Wei, Task clustering and scheduling for distributed memory parallel architectures, IEEE Trans. Parallel Distrib. Syst, vol.7, issue.1, pp.46-55, 1996.

M. Pelcat, P. Menuet, S. Aridhi, and J. Nezan, Scalable compile-time scheduler for multi-core architectures, 2009 Design, Automation & Test in Europe Conference & Exhibition, p.122, 2009.
DOI : 10.1109/DATE.2009.5090909
URL : https://hal.archives-ouvertes.fr/hal-00429393

J. Piat and M. Raulet, Maxime Pelcat, Pengcheng Mu, and Olivier Déforges. An extensible framework for fast prototyping of multiprocessor dataflow applications, IDT'08: Proceedings of the 3rd International Design and Test Workshop, p.27, 2008.

H. Christos, Papadimitriou and Mihalis Yannakakis. Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput, vol.19, issue.2, pp.322-328, 1990.

G. Roquier, M. Raulet, J. Nezan, O. Déforgesrs87, and ]. V. Rayward-smith, Using RTOS in the AAA methodology automatic executive generation Uet scheduling with unit interprocessor communication delays, Proceedings of 14th European Signal Processing Conference, pp.1055-71, 1987.

F. M. Raulet, J. Urban, C. Nezan, O. Moy, and . Déforges, Syndex executive kernels for fast developments of applications over heterogeneous architectures, Proceedings of 13th European Signal Processing Conference, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00084161

F. M. Raulet, J. Urban, C. Nezan, O. Moy, Y. Déforges et al., Rapid Prototyping for Heterogeneous Multicomponent Systems: An MPEG-4 Stream over a UMTS Communication Link, EURASIP Journal on Advances in Signal Processing, vol.6, issue.3, 2005.
DOI : 10.1155/ASP/2006/64369

G. Roquier, M. Wipliez, M. Raulet, J. W. Janneck, I. D. Miller et al., Automatic software synthesis of dataflow program: An MPEG-4 simple profile decoder case study, 2008 IEEE Workshop on Signal Processing Systems, p.21, 2008.
DOI : 10.1109/SIPS.2008.4671776
URL : https://hal.archives-ouvertes.fr/hal-00336516

. Vivek-sarkarsb00-]-sundararajan, S. S. Sriram, and . Bhattacharyya, Partitioning and Scheduling Parallel Programs for Multiprocessors Embedded Multiprocessors -Scheduling and Synchronization Communication interface generation for hw/sw architecture in the starsoc environment, pp.58-55, 1989.

S. [. Sivanandam and . Deepa, Introduction to Genetic Algorithms, p.61, 2008.

R. Sosic and J. Gu, Fast search algorithms for the n-queens problem, IEEE Transactions on Systems, Man, and Cybernetics, vol.21, issue.6
DOI : 10.1109/21.135698

M. [. Stuijk, T. Geilen, and . Basten, SDF^3: SDF For Free, Sixth International Conference on Application of Concurrency to System Design (ACSD'06), pp.276-278, 2006.
DOI : 10.1109/ACSD.2006.23

]. G. Sl93a, E. A. Sih, and . Lee, A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures

]. G. Sl93b, E. A. Sih, L. Lee-sinnen, and . Sousa, Declustering: a new multiprocessor scheduling technique: A specification for XML meta-data and tool interfaces The SPIRIT Consortium List scheduling: Extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures, IEEE Transactions on Parallel and Distributed Systems IEEE Transactions on Parallel and Distributed Systems, pp.175-187, 1993.

L. [. Sinnen and . Sousa, Communication contention in task scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.6
DOI : 10.1109/TPDS.2005.64

S. O. Sinnen, L. Sousa, and F. E. Sandnes, Communication contention in task scheduling, IEEE Transactions on Parallel and Distributed Systems Topcuoglu, S. Hariri, and Min-You Wu. Task scheduling algorithms for heterogeneous processors. Heterogeneous Computing WorkshopHCW '99) Proceedings. Eighth, pp.503-515, 1994.
DOI : 10.1109/TPDS.2005.64

S. [. Topcuoglu, M. Hariri, and . Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing. Parallel and Distributed Systems, IEEE Transactions on, vol.13, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.122

D. Wu, R. J. Wong, and . Morris, Hypertool: a programming aid for message-passing systems, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.330-343, 1989.
DOI : 10.1109/71.80160

L. Wang, H. J. Siegel, V. R. Roychowdhury, and A. A. Maciejewski, Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach, Journal of Parallel and Distributed Computing, vol.47, issue.1, pp.8-22, 1997.
DOI : 10.1006/jpdc.1997.1392

]. A. Wu, H. Yu, S. Jin, K. Lin, and G. Schiavone, An incremental genetic algorithm approach to multiprocessor scheduling. Parallel and Distributed Systems, IEEE Transactions on, vol.15, issue.9, pp.824-834, 2004.
DOI : 10.1109/tpds.2004.38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.5169

W. Woo, S. Yang, S. Kim, and T. Han, Task scheduling in distributed computing systems with a genetic algorithm, High Performance Computing on the Information Superhighway HPC Asia '97, pp.301-305, 1997.

. Xilinx, Xilinx dataflow tools, 2008.

T. Yang and A. Gerasoulis, List scheduling with and without communication delays, Parallel Computing, vol.19, issue.12, pp.1321-1344, 1993.
DOI : 10.1016/0167-8191(93)90079-Z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5353

T. Yang and A. Gerasoulis, DSC: scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.9, pp.951-967, 1994.
DOI : 10.1109/71.308533