A. Ahmad and Z. Hanzálek, An energy efficient schedule for IEEE 802.15.4/zigbee cluster tree WSN with multiple collision domains and period crossing constraint, IEEE Transactions on Industrial Informatics, vol.14, issue.1, pp.12-23, 2018.

D. Alacaide, C. Chu, V. Kats, E. Levner, and G. Sierksma, Cyclic multiple robot scheduling with time-window constraints using a critical path approach, European Journal of Operational Resarch, vol.177, pp.147-162, 2007.

M. Ayala, A. Benabid, C. Artigues, and C. Hanen, The resource-constrained modulo scheduling problem: an experimental study, Computational Optimization and Applications, vol.54, issue.3, pp.645-673, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00568925

L. Barroso, The price of performance, ACM Queue, vol.3, issue.7, pp.48-53, 2005.

M. J. Bekooij, P. G. Jansen, G. J. Smit, and M. H. Wiggers, Efficient computation of buffer capacities for cyclo-static real-time systems with back-pressure, 44th ACM/IEEE Design Automation Conference, pp.281-292, 2007.

A. Benabid and C. Hanen, Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays, Journal of Scheduling, vol.14, issue.5, pp.511-522, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01185245

A. Benabid-najjar, C. Hanen, O. Marchetti, and A. M. Kordon, Periodic schedules for bounded timed weighted event graphs, IEEE Transactions on Automatic Control, vol.57, issue.5, pp.1222-1232, 2012.

M. Benazouz, O. Marchetti, A. M. Kordon, and P. Urard, A new approach for minimizing buffer capacities with throughput constraint for embedded system design, The 8th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010, pp.1-8, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00368648

M. Benazouz, O. Marchetti, A. Munier-kordon, and T. Michel, A new method for minimizing buffer sizes for cyclo-static dataflow graphs, 2010 8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, pp.11-20, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00461647

F. Blachot, B. D. De-dinechin, and G. Huard, SCAN: A Heuristic for Near-Optimal Software Pipelining, Parallel Processing, vol.4128, 2006.

B. Bodin, A. M. Kordon, and B. D. De-dinechin, K-periodic schedules for evaluating the maximum throughput of a synchronous dataflow graph, 2012 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, pp.152-159, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00880624

B. Bodin, A. M. Kordon, and B. D. De-dinechin, Optimal and fast throughput evaluation of CSDF, DAC '16 Proceedings of the 53rd Annual Design Automation Conference, vol.160, pp.1-160, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01358062

P. Y. Calland, A. Darte, and Y. Robert, Circuit retiming applied to decomposed software pipelining, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.1, pp.24-35, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00856850

J. Carlier and P. Chrétienne, Problèmes d'ordonnancement : modèlisation, complexité, algorithmes, 1988.

H. Claire, Cyclic scheduling, Introduction to Scheduling, 2009.

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

A. Darte and G. Huard, Loop shifting for loop compaction, International Journal of Parallel Programming, vol.28, issue.499, pp.415-431, 2000.

A. Dasdan, S. Irani, and R. K. Gupta, Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems, DAC '99 Proceedings of the 36th annual ACM/IEEE Design Automation Conference, pp.37-42, 1999.

B. Dupont-de-dinechin, C. Artigues, and S. Azem, Resource-constrained moulo scheduling, Resource Constrained Project Scheduling: Models, Algorithms, Extensions and Applications, Control Systems, Robotics and Manufacturing Series, pp.267-277, 2008.

A. Eichenberger and E. Davidson, Efficient formulation for optimal modulo schedulers, ACM SIGPLAN conference on programming language design and implementation, pp.194-205, 1997.

F. Gasperoni and U. Schwiegelshohn, Generating close to optimum loop schedules on parallel processors, Parallel Processing Letters, vol.4, pp.391-403, 1994.

T. Goubier, R. Sirdey, S. Louise, and V. David, ?c: A programming model and language for embedded manycores, Algorithms and Architectures for Parallel Processing -11th International Conference, pp.385-394, 2011.

C. Hanen and Z. Hanzalek, Grouping tasks to save energy in a cyclic scheduling problem: a complexity study, HAL CCSD, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01272444

C. Hanen and A. Munier, Cyclic scheduling on parallel processors: An overview, Scheduling theory and its applications. J. Wiley and sons, 1994.

C. Hanen and A. Munier, A study of the cyclic scheduling problem on parallel processors, Discrete Applied Mathematics, vol.57, issue.2-3, pp.167-192, 1995.

Z. Hanzálek and C. Hanen, The impact of core precedences in a cyclic RCPSP with precedence delays, Journal of Scheduling, vol.18, issue.3, pp.275-284, 2015.

V. Kats and E. Levner, Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling, Computers & Industrial Engineering, vol.61, issue.2, pp.279-288, 2011.

J. Khatib, A. M. Kordon, E. C. Klikpo, and K. Trabelsi-colibet, Computing latency of a real-time system modeled by synchronous dataflow graph, Proceedings of the 24th International Conference on Real-Time Networks and Systems, RTNS 2016, pp.87-96, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01449892

E. A. Lee and D. G. Messerschmitt, Synchronous data flow, Proceedings of the IEEE, vol.75, issue.9, pp.1235-1245, 1987.

C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.

O. Marchetti and A. M. Kordon, Complexity results for weighted timed event graphs, Discrete Optimization, vol.7, issue.3, pp.166-180, 2010.

O. Marchetti and A. Munier-kordon, Cyclic scheduling for the synthesis of embedded systems, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01297931

O. Marchetti and A. Munier-kordon, A sufficient condition for the liveness of weighted event graphs, European Journal of Operational Research, vol.197, issue.2, pp.532-540, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01197183

A. Munier, Régime asymptotique optimal d'un graphe d'événements temporisé généralisé: applicationà un problème d'assemblage, vol.27, pp.487-513, 1993.

A. Munier-kordon, A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule, Journal of Scheduling, vol.14, issue.1, pp.103-117, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01195915

H. Oh and S. Ha, Efficient code synthesis from extended dataflow graphs for multimedia applications, Proceedings of the 39th Design Automation Conference, pp.275-280, 2002.

J. Pempera and C. Smutnicki, Open shop cyclic scheduling, European Journal of Operational Research, vol.269, issue.2, pp.773-781, 2018.

B. R. Rau, Iterative modulo scheduling: an algorithm for software pipelining loops, MI-CRO 27: Proceedings of the 27th annual international symposium on Microarchitecture, p.30

Y. Robert and F. Vivien, Introduction to Scheduling, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786389

W. Thies, M. Karczmarek, M. Gordon, D. Z. Maze, J. Wong et al., StreamIt: A compiler for streaming applications, Massachussetts Institute of Technology, 2001.