J. M. Adan, M. F. Magalh, and K. Ramamritham, Meeting hard-real-time constraints using a client-server model of interaction, Proceedings Seventh Euromicro Workshop on Real-Time Systems
DOI : 10.1109/EMWRTS.1995.514323

K. Andersssons, ]. B. Bletsasabj01, S. Anderson, J. Baruah, and . Jonson, Sporadic multiprocessor scheduling with few preemptions Static-priority scheduling on multiprocessors A comparison of list schedules for parallel processing systems, Proceedings of the 7th Euromicro Workshop on Real-Time systems Proceedings of the 22th Euromicro Conference on Real-Time Systems ECRTS'08 Proceedings of 21th IEEE Real-Time Systems Symposium RTSS'01 The slack method: A new method for static allocation of hard realtime tasks, pp.286-293685, 1974.

A. Andersson and E. Tovar, Multiprocessor Scheduling with Few Preemptions, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), pp.322-334, 2003.
DOI : 10.1109/RTCSA.2006.45

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2498

P. Theodore, . P. Bakerbak03-]-t, and . Baker, Stack-based scheduling of realtime processes. Real-Time Systems Multiprocessor edf and deadline monotonic schedulability analysis, Proceedings of 24th IEEE International Real-Time Systems Symposium RTSS'03 Baruah. Optimal utilization bounds for the fixed-priority scheduling of the periodic task system on identical multiprocessors, pp.67-99, 1991.

G. [. Bini, . Buttazzobb08-]-s, T. Baruah, . K. Baker-[-bg03-]-s, J. Baruah et al., Techniques for multiprocessor global schedulability analysis Measuring the performance of schedulability tests. Real-Time Syst Schedulability analysis of global edf, IEEE Transactions On Computers Proceedings of 28th IEEE Real-Time Systems Symposium RTSS'07 Finke. Minimizing mean weigthed execution time loss on identical and uniform processors. Information processing letters, pp.129-154223, 1997.

J. [. Baruah and . Goossens, Rate-monotonic scheduling on uniform multiprocessors, IEEE Transactions on Computers, vol.52, issue.7, 2003.
DOI : 10.1109/TC.2003.1214344

]. F. Bim07 and . Bimbard, Dimensionnement temporel de systèmes embarqués: application à OSEK

C. Phd-thesis, . [. Laboratory, J. Burchard, Y. Liebeherr, S. H. Oh et al., New strategies for assigning real-time tasks to multiprocessor sys- tems, 2007.

A. Burns, K. Tindell, and A. Wellings, Effective analysis for engineering real-time fixed priority schedu- lers, IEEE Transaction on computers, vol.44, issue.12, pp.1429-1442, 1995.

. Cch-+-99-]-p, . Calégari, A. Coray, D. Hertz, P. Kobler et al., A taxonomy of evolutionary algorithms in combinatorial optimiza- tion

F. Cottet, J. Delacroix, C. Kaiser, Z. [. Mammeri, L. Courbin et al., Ordonnancement temps réel -Cours et exercices corrigés. Hermès, janvier Fortas: Framework for real-time analysis and simulation, Proceedings of the 2th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems Choquet-Geniet and E. Grolleau. Minimal schedulability interval for real-time systems of periodic tasks with offsets, pp.145-158, 1999.

. Theor, . Comput, . G. Scicgmv98-]-e, G. Coffman, S. Galambos et al., Bin packing approximation algorithms: Combinatorial analysis. Handbook of combinatorial optimization Task allocation in distributed data processing, Chu and L. M-T. Lan. Task allocation and precedence relation for distributed real-time systems, pp.117-13457, 1980.

J. [. Carlson, M. Mäki-turja, and . Nolin, Event-pattern triggered real-time tasks, IEEE Transactions on Computers Proceedings of the 16th International Conference on Real-Time and Network Systems, RTNS'08 M. Silly, and T. Bouchentouf. Dynamic scheduling of real-time tasks under precedence constraints, p.36, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00336476

[. Chen and J. Yur, A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint, 2004.

D. , R. I. Davis, A. Burnsdd86-]-s, and S. K. Davari, A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems An on line algorithm for real-time allocation On a real-time scheduling problem, Procedings of ICDCS Proceedings of IEEE Real-Time Systems Symposium Series in Operations Research, pp.494-501, 1978.

J. [. Ekelin and . Jonsson, Solving embedded system scheduling problems using constraint programming, 2000.

J. [. Aarts and . Lenstra, Local search in combinatorial optimization, 1997.

I. [. Echague, A. Ripoll, and . Crespo, Hard real-time preemptively scheduling with high context switch cost, Proceedings Seventh Euromicro Workshop on Real-Time Systems
DOI : 10.1109/EMWRTS.1995.514310

E. [. Hong, N. Hou, . Ansari-[-esha94-]-r, E. S. Hong, N. Hou et al., Efficient multiprocessor scheduling based on genetic algorithms A genetic algorithm for multiprocessor scheduling. Transaction on parallel and distributed systems, 1994. [FBG + 10a] J. Forget, F. Boniol, E. Grolleau, D. Lesens, and C. Pagetti. Scheduling dependent periodic tasks without synchronization me- chanisms, 1990.

]. J. Fbg-+-10b, F. Forget, E. Boniol, D. Grolleau, C. Lesens et al., Scheduling dependent periodic tasks without synchronization me- chanisms

M. [. Franca, G. Gendreau, F. M. Laporte, and . Muller, A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times, International Journal of Production Economics, vol.43, issue.2-3, pp.79-89, 1996.
DOI : 10.1016/0925-5273(96)00031-X

E. [. Forget, C. Grolleau, P. Pagetti, and . Richard, Dynamic Priority Scheduling of Periodic Tasks with Extended Pre- cedences

F. , L. R. Ford, J. , and D. R. Fulkerson, Flows network, IEEE 16th Conference on Emerging Technologies Factory Automation (ETFA)GFB03] J. Goossens, S. Funk, and S. Baruah. Priority-driven scheduling of periodic task systems on multiproces- sors, 1962.

J. Garey, Computers and intractability: a guide to the theory of NP- completeness, Real Time Systems, vol.25, pp.187-205, 2003.

J. Wiley, &. Sons, . P. Inc, G. Gai, M. D. Lipari et al., Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip, 1993.

]. J. Goo07, . Goossensgra00-]-t, . [. Grandpierre, S. Gerasoulis, T. Venugopal et al., Introduction à l'ordonnancement temps réel multiprocesseur Ecole d'étè temps réel Modèlisation d'architectures parallèles hétérogènes pour la génération automatique d'exécutifs distribués temps réel optimisés Clustering task graphs for message passing architectures, Proceedings of the 4th international conference on Supercomputing ACM. [Hav68] J. W. Havende. Avoiding deadlock in multitasking systems, pp.447-45674, 1968.

[. 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
DOI : 10.1137/0218016

S. J. Comput, M. Hutton, J. P. Grossman, J. Rose, and D. Corneil, Characterization and parameterized random generation of digital circuits, pp.244-257, 1989.

P. [. Joseph, C. Pandya, and . Kaiser, Finding Response Times in a Real-Time System, The Computer Journal, vol.29, issue.5, pp.390-395, 1986.
DOI : 10.1093/comjnl/29.5.390

H. [. Katcher, J. K. Arakawa, and . Strosnider, Engineering and analysis of fixed priority schedulers, IEEE Transactions on Software Engineering, vol.19, issue.9, 2004.
DOI : 10.1109/32.241774

F. Kiraç, U. Bilge, M. Kurtulan, and P. Pekgün, A tabu search algorithm for parallel machine total tardiness pro- blem, IEEE Trans. Softw. Eng, vol.19, issue.9, pp.920-934, 1993.

]. H. Kop98 and . Kopetz, The time-triggered model of computation, Proceedings of the IEEE Real Time Systems Symposium, RTSS'98 Sorel. A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor, pp.168-177, 1998.

J. [. Kadamuddi and . Tsai, Clustering algorithm for parallelizing software systems in multiprocessors environment, Proceedings of ISCA 20th International Conference on Parallel and Distributed Computing Systems, PDCS'07, 2007.
DOI : 10.1109/32.844493

N. [. Kato, N. Katoa, and . Yammasaki, Real-Time Scheduling with Task Splitting on Multiprocessors, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), pp.340-361, 2000.
DOI : 10.1109/RTCSA.2007.61

J. [. Lopez, M. Diaz, and . Garcia, Utilization bounds for multiprocessor rate-monotonic scheduling, The 15th IEEE International Conference on Emerging Technologies and Factory Automation Lopez, J. L. Diaz, and M. Garcia. Utilization bounds for edf multiprocessor rate-monotonic schedu- ling, pp.5-28, 2003.
DOI : 10.1023/A:1021749005009

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9301

M. [. Lopez, D. F. Garcia, and . Diaz, Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling, Real Time Systems, 2004.
DOI : 10.1109/TPDS.2004.25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9301

M. [. Lopez, J. L. Garcia, D. F. Diaz, and . Garcia, Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000, 2004.
DOI : 10.1109/EMRTS.2000.853989

J. [. Liu and . Layland, Scheduling algorithms for multiprogramming in a hard-real-time environnment, Proceedings of 19th Euromicro Conference on Real-Time Systems , ECRTS'00, 2000.

M. [. Leung, . [. Merrill, L. Lechoczky, Y. Sha, and . Ding, A note on preemptive scheduling of periodic, real-time tasks The rate-monotonic scheduling algorithm:exact characterization an average behavior, Journal of the ACM Information Processing Letters, vol.20, issue.113, 1973.

[. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, IEEE Real-Time Systems Symposium RTSS'89Mit02] J. E. Mitchell. Branch-and-cut algorithms for combinatorial optimization pro- blems, pp.166-171237, 1982.
DOI : 10.1016/0166-5316(82)90024-4

C. L. Mccreary, A. A. Khan, J. J. Thompson, and M. E. Mcardle, A comparison of heuristics for scheduling dags on multiprocessors Fundamental design problems of distributed systems for the hardreal-time environment, OB98] D. I. Oh and T. P. Baker. Utilization bounds for n-processor rate monotone scheduling with stable processor assignment, 1983.

S. [. Oh and . Son, Tight performance bounds of heuristics for a real-time scheduling problem, Real Time Systems Oh and S.H. Son. Fixed-prioriy scheduling of periodic task on multiprocessor sys- tems, pp.183-193, 1993.

[. Peng, K. G. Shin, and T. F. Abdelzaher, Assignment and scheduling communicating periodic tasks in distributed real-time systems, 2001.

S. Ramamurth and M. Moir, Static-priority periodic scheduling on multiprocessors, Proceedings 21st IEEE Real-Time Systems Symposium, pp.26-34, 1984.
DOI : 10.1109/REAL.2000.895997

S. L. Sha, R. Rajkumar, and J. P. Lehoczky, Priority inheritance protocols: An approach to real-time synchroni- zation, Département Systèmes Informatiques et Systèmes Embarqués, 2011.
DOI : 10.1109/12.57058

L. Sinnen and . Sousa, List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Real-Time Systems Multiprocessor scheduling with the aid of network flow algorithms, IEEE Transactions on ComputersSto77] H. S. Stone, pp.1175-118581, 1977.

]. E. Tal09, . [. Talbi, A. Tindell, A. Burns, ]. R. Wellingsvan96 et al., Scalable real-time system design using preemption thresholds Metaheuristics: From design to implementation Allocating hard real time task. Real time systems Constraint-based Local search Scheduling fixed-priority tasks with preemption threshold, Mathematical. Structures in Comp. Sci. Proceedings of 1th IEEE Real-Time Systems symposium Linear programming: Foundations and extensions, 1996. [VM05] P. V.Hentenryck and L. Michel Proceedings of the 6 International Conference on Real-Time Computing Systems and Applications, RTCSA'99 List scheduling with duplication for heterogeneous computing sys- tems, pp.383-406145, 1992.

]. J. Xu93 and . Xu, Multiprocessor scheduling of processes with release times, deadlines , precedence, and exclusion relations, J. Parallel Distrib. Comput, vol.70, pp.323-329, 2010.