S. L. Enfin, étude du fonctionnement multimodal est bien élaborée, elle pourrait s'intégrer dans un projet d'expérimentation sur une plateforme linux temps-réel selon une approche 'dual-kernel

E. Ordonnancement and .. , un système de tâches sur 2 processeurs avec partage d'une ressource critique, p.102

E. Ordonnancement and .. , un système de tâches sur 3 processeurs avec partage d'une ressource critique, p.102

E. Ordonnancement and .. , un système de tâches sur 3 processeurs avec une panne d'un processeur à l'instant t p = 3, p.104

E. Ordonnancement and .. , un système de tâches sur 3 processeurs avec une panne d'un processeur à l'instant t p = 3, p.104

R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time. Information and Computation, pp.2-34, 1993.

R. Alur and D. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

B. Anderson and J. Jonsson, The utilization bounds of partitioned and pfair staticpriority scheduling on multiprocessors are 50%, Proceedings of the 15 th Euromicro Conference on Real-Time Systems, pp.33-40, 2003.

J. Anderson, A. Block, and A. Srinivasan, Pfair scheduling: beyond periodic task systems, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications, pp.35-43, 2000.
DOI : 10.1109/RTCSA.2000.896405

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

J. Anderson and A. Srinivasan, Early-release fair scheduling, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000, pp.35-43, 2000.
DOI : 10.1109/EMRTS.2000.853990

J. Anderson and A. Srinivasan, Mixed Pfair/ERfair scheduling of asynchronous periodic tasks, Proceedings of the 13 th Euromicro Conference on Real-Time Systems, pp.76-85, 2001.
DOI : 10.1016/j.jcss.2003.08.002

J. Anderson and A. Srinivasan, A new look at pfair priorities. Real-time Systems Journal, 1999.

B. Andersson, Static-priority scheduling on multiprocessors, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), 2003.
DOI : 10.1109/REAL.2001.990610

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

J. Andersson, S. Baruah, and J. Jonsson, Static-priority scheduling on multiprocessors, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), pp.193-202, 2001.
DOI : 10.1109/REAL.2001.990610

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

D. Aoun, A. M. Déplanche, and Y. Trinquet, Pfair scheduling improvement to reduce interprocessor migrations, Proceedings of RTNS 08, pp.131-138, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00336513

T. P. Baker, Multiprocessor EDF and deadline monotonic schedulability analysis, Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748), 2003.
DOI : 10.1109/REAL.2003.1253260

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

T. P. Baker, An analysis of EDF schedulability on a multiprocessor, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.8, pp.760-768, 2005.
DOI : 10.1109/TPDS.2005.88

T. P. Baker, An Analysis of Fixed-Priority Schedulability on a Multiprocessor, Real-Time Systems, vol.28, issue.2???3, pp.49-71, 2006.
DOI : 10.1007/S11241-005-4686-1

M. Barabanov, A linux-based real-time operating system. Master's Thesis, New Mexico Institute of Mining and Technology, 1997.

S. Baruah, Fairness in periodic real-time scheduling, Proceedings 16th IEEE Real-Time Systems Symposium, pp.200-209, 1995.
DOI : 10.1109/REAL.1995.495210

S. Baruah, J. Gehrke, and C. G. Plaxton, Fast scheduling of periodic tasks on multiple resources, Proceedings of 9th International Parallel Processing Symposium, pp.280-288, 1995.
DOI : 10.1109/IPPS.1995.395946

S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, Proportionate progress, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.600-625, 1996.
DOI : 10.1145/167088.167194

S. K. Baruah and J. Goossens, Scheduling real-time tasks : Algorithms and complexity . In Handbook of scheduling :Algorithms, Models, and Performance Analysis, 2004.

S. K. Baruah, L. E. Rosier, and R. R. Howell, Algorithms and complexity concernig the preemptive scheduling of periodic, real-time tasks on one processor. Real- Time Systems, pp.301-324, 1990.

A. Bondavalli, J. Stankovic, and L. Strigini, Adaptable fault tolerance for real-time systems. Rapport technique, 1994.

A. Burchard, J. Liebeherr, Y. Oh, and S. H. Son, New strategies for assigning realtime tasks to multiprocessor systems, IEEE Transactions on Computers, vol.44, issue.12, 1995.

A. Burchard, Y. Oh, J. Liebeherr, and S. H. Son, A linear-time online task assignment scheme for multiprocessor systems, Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software, 1994.
DOI : 10.1109/RTOSS.1994.292566

A. Burns, The ravenscar profile. Rapport technique, 2002.

A. Burns, R. Davis, and S. Punnekkat, Feasibility analysis of fault-tolerant real-time task sets, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, 1996.
DOI : 10.1109/EMWRTS.1996.557785

A. Burns and A. J. Wellings, Real-Time Systems and Programming Languages

G. C. Buttazzo, Hard Real-Time Computing Systems,predictable scheduling ,algorithms and applications, 1997.

C. Han and H. Tyan, A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms, Proceedings Real-Time Systems Symposium, pp.36-45, 1997.
DOI : 10.1109/REAL.1997.641267

E. Chanthery and Y. Pencolé, Mod??lisation et int??gration du diagnostic actif dans une architecture embarqu??e, Journal Europ??en des Syst??mes Automatis??s, vol.43, issue.7-9, pp.789-803, 2009.
DOI : 10.3166/jesa.43.789-803

H. Chetto and M. Chetto, Some Results of the Earliest Deadline Scheduling Algorithm, IEEE Transactions on Software Engineering, vol.15, issue.10, pp.1261-1269, 1989.
DOI : 10.1109/TSE.1989.559777

H. Chetto, M. Silly, and T. Bouchentouf, Dynamic scheduling of real-time tasks under precedence constraints, Real-Time Systems, vol.21, issue.10, pp.115-127, 1990.
DOI : 10.1007/BF00365326

A. Choquet-geniet, Panorama de l'ordonnancement temps-réel, Actes de l'école d'éte E.T.R'03, pp.213-226, 2003.

A. Choquet-geniet, Un premier pas vers l'étude de la cyclicité en environnement multiprocesseurs, Actes de la conférences RTS'05, pp.289-302, 2005.

A. Choquet-geniet, Les réseaux de Petri -Un outil de modélisation. Dunod, 2006.

A. Choquet-geniet, Systèmes parallèles et Temps-réel. Mémoire d'Habilitation à Diriger des Recherches, 2000.

A. Choquet-geniet, D. Geniet, and F. Cottet, Exhaustive computation of the scheduled task execution sequences of a real-time application, Proc. of FTRTFT'96, 1996.
DOI : 10.1007/3-540-61648-9_44

A. Choquet-geniet and E. Grolleau, Minimal schedulability interval for real-time systems of periodic tasks with offsets, Theoretical Computer Science, vol.310, issue.1-3, pp.117-134, 2004.
DOI : 10.1016/S0304-3975(03)00362-1

A. Choquet-geniet and S. Malo, Finding cyclicity behavior in multiprocessor scheduling, 2009.

E. M. Clarke, E. A. Emerson, and A. P. Sisla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

E. Coffman, G. Galambos, S. Martello, and D. Vigo, Bin Packing Approximation Algorithms: Combinatorial Analysis, 1998.
DOI : 10.1007/978-1-4757-3023-4_3

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

E. G. Coffman, M. R. Garey, and D. S. Johnson, Approximation algorithms for binpacking-a survey, Ananlysis and Design of Algorithms in Combinatorial Optimization , G. Ausiello and M. Lucertini, 1981.

L. Cucu and J. Goossens, Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors, 2006 IEEE Conference on Emerging Technologies and Factory Automation, pp.397-405, 2006.
DOI : 10.1109/ETFA.2006.355388

L. Cucu and J. Goossens, Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems, 2007 Design, Automation & Test in Europe Conference & Exhibition, pp.1635-1640, 2007.
DOI : 10.1109/DATE.2007.364536

URL : https://hal.archives-ouvertes.fr/inria-00192210

S. Davari and S. K. , On a periodic real-time task allocation problem, Annual International Conference on System Sciences, 1986.

L. David, F. Cottet, and E. Grolleau, Gigue temporelle et ordonnancement par échéance dans les appilcations temps-réel, Pro. of IEEE Conférence Internationale Francophone d'Automatique, 2000.

D. Decotigny, Une infrastructure de simulation modulaire pour l'évaluation de performances de systèmes temps-réel, Thèse de doctorat, 2003.

J. Delacroix, Stabilitée et régisseur d'ordonnancement en temps réel, Technique et Sciences Informatiques, pp.223-250, 1994.

M. L. Dertouzos and A. K. Mok, Multiprocessor online scheduling of hard-real-time tasks, IEEE Transactions on Software Engineering, vol.15, issue.12, pp.1497-1506, 1989.
DOI : 10.1109/32.58762

S. K. Dhall and C. L. Liu, On a Real-Time Scheduling Problem, Operations Research, vol.26, issue.1, pp.127-140, 1978.
DOI : 10.1287/opre.26.1.127

J. and L. Ed, Handbook of scheduling :Algorithms, Models, and Performance Analysis. Chapman and Hall, 2004.

C. Ekelin and J. Jonsson, Solving embedded system scheduling problems using constraint programming, IEEE RTSS, 2000.

M. R. Garey and D. S. Johnson, Scheduling Tasks with Nonuniform Deadlines on Two Processors, Journal of the ACM, vol.23, issue.3, pp.461-467, 1976.
DOI : 10.1145/321958.321967

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

O. Gonzalez, H. Shrikumar, J. A. Stankovic, and K. Ramamritham, Adaptive fault tolerance and graceful degradation under dynamic hard real-time constraints, Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997.

V. Grassi, L. Donatiello, and S. Tucci, On the optimal checkpointing of critical tasks and transaction-oriented systems, IEEE Transactions on Software Engineering, vol.18, issue.1, pp.72-77, 1992.
DOI : 10.1109/32.120317

E. Grolleau, Ordonnancement Temps-Réel Hors-Ligne Optimal à l'Aide de Réseaux de Petri en Environnement Monoprocesseur et Multiprocesseur, Thèse de doctorat, 1999.

E. Grolleau and A. Choquet-geniet, Scheduling real-time systems by means of petri nets, Proc. of 25 t h Workshop on Real-Time Programming, pp.95-100

E. Grolleau and A. Choquet-geniet, Real-time scheduling in multiprocessor environment by means of Petri nets, Proceedings of RTS 2001, pp.189-206, 2001.

E. Grolleau and A. Choquet-geniet, Off-Line Computation of Real-Time Schedules by Means of Petri nets, Journal of Discrete Event Dynamic Systems, vol.12, pp.311-333, 2002.
DOI : 10.1007/978-1-4615-4493-7_32

E. Grolleau, A. Choquet-geniet, and F. Cottet, Modélisation des systèmes réactifs par réseaux de petri autonomes en vue de leur analyse hors-ligne, Proceedings of MSR'99, pp.17-26, 1999.

G. H. Kopetz, The programmer's view of MARS, [1992] Proceedings Real-Time Systems Symposium, pp.223-226, 1992.
DOI : 10.1109/REAL.1992.242660

A. C. Heursch, Preemption concepts, rhealstone benchmark and scheduler analysis of linux 2.4, proceedings of the Real-Time and Embedded Computing Expo and Conference, 2001.

K. S. Hong and J. Leung, On-line scheduling of real-time tasks, 1988.

R. Janicki, P. E. Lauer, M. Koutny, and R. Devillers, Maximally concurrent evolution of non-sequential systems, Theorical Computer Science, vol.43, issue.2-3, pp.213-238, 1986.
DOI : 10.1007/3-540-15670-4_13

K. Jensen, Coloured Petri nets, basic concepts, analysis methods and pratical use. Monographs in theoretical Computer Science, 1996.

M. Joseph and P. Pandya, Finding response times in a real-time system. The computer journal, pp.390-395, 1986.

R. M. Karp and V. Ramchandani, Parallel Algorithms for Shared-Memory Machines
DOI : 10.1016/B978-0-444-88071-0.50022-9

J. V. Dans, Leuwen, éditeur, Algorithms and complexity, pp.869-935, 1990.

C. M. Krishna, K. G. Shin, and Y. Lee, Optimization criteria for checkpoint placement, Communications of the ACM, vol.27, issue.10, pp.1008-1012, 1984.
DOI : 10.1145/358274.358282

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

S. Lauzac, R. Melhem, and D. Mosse, An improved rate-monotonic admission control and its applications, IEEE Transactions on Computers, vol.52, issue.3, 2003.
DOI : 10.1109/TC.2003.1183948

S. Lauzac, R. Melhem, and D. Mosse, Comparaison fo global and partitioning schemes for scheduling rm tasks on multiprocessor, Time Systems, 1998.

P. A. Lee and T. Anderson, Fault tolerance : Principe and practice, 1990.

J. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, [1990] Proceedings 11th Real-Time Systems Symposium, pp.201-209, 1990.
DOI : 10.1109/REAL.1990.128748

J. Leung and M. Merill, A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, pp.115-118, 1980.
DOI : 10.1016/0020-0190(80)90123-4

J. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, pp.237-250, 1982.

J. Y. Leung and M. L. , A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, pp.115-118, 1980.
DOI : 10.1016/0020-0190(80)90123-4

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.
DOI : 10.1145/321738.321743

J. Liu and R. Ha, Efficient methods of validating timing constraints Advances in Real-Time Systems, pp.199-223, 1995.

J. W. Liu, Real-Time Systems, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00544464

J. M. Lopez, J. L. Diaz, and D. F. Garcia, Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.7, 2004.
DOI : 10.1109/TPDS.2004.25

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

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

J. M. Lopez, M. Garcia, J. L. Diaz, and D. F. Garcia, Utilization bounds for multiprocessor rate-monotonic scheduling, Real Time Systems, vol.24, issue.1, 2003.

J. M. Lopez, M. Garcia, J. L. Diaz, and D. F. Garcia, Utilization bounds for edf scheduling on real-time multiprocessor systems, Real Time Systems, vol.28, issue.1, 2004.

C. Macq and J. Goossens, Limitation of the hyper-period in real-time periodic task set generation, Proceedings of the 9th international conference on real-time systems, pp.133-148, 2001.

G. Miremadi and J. Torin, Evaluating processor-behavior and three error-detection mechanisms using physical fault-injection, IEEE Transactions on Reliability, vol.44, issue.3, pp.441-453, 1995.
DOI : 10.1109/24.406580

A. K. Mok and M. L. Dertouzos, Multi processor scheduling in a hard real-time environment, Proc. of 7 th Texas Conference on Computer Systems, 1978.

R. Muntz and E. G. Coffman-jr, Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems, Journal of the ACM, vol.17, issue.2, pp.324-338, 1970.
DOI : 10.1145/321574.321586

D. I. Oh and T. Baker, Utilization bound for n-processor rate monotonic scheduling with static processor assignment. Real-Time Systems, pp.183-192, 1998.

Y. Oh and S. H. Son, Fixed priority scheduling of periodic tasks on multiprocessor systems. Rapport technique, 1995.

Y. Oh and S. H. Son, Tight performance bounds of heuristics for real-time scheduling problem. Rapport technique

G. Cabilic, A. Colin, D. Decotigny, P. Chevochot, I. Puaut et al., Hades : a distributed system for dependable hard real-time applications built from cots components, 2000.

S. Punnekkat, Schedulability Analysis for Fault Tolerant Real-Time Systems

K. Ramamritham, J. A. Stankovic, and P. Shiah, O(n) scheduling algorithms for realtime multiprocessor systems, International Conference on Parallel Processing, pp.143-153, 1989.

S. Ramamurthy, Scheduling periodic hard real-time tasks with arbitrary deadlines on multiprocessors, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., p.59, 2002.
DOI : 10.1109/REAL.2002.1181562

S. Ramamurthy and M. Moir, Static-priority scheduling on multiporcesors, Proceedings of the 21 s t IEEE Real-Time Systems Symposium, pp.69-78, 2000.

C. Ramchandani, Analysis of asynchronous concurrent systems by petri nets. Rapport technique, MIT, project MAC, 1974.

R. D. Schlichting and F. B. Schneider, Fail-stop processors: an approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems, vol.1, issue.3, 1983.
DOI : 10.1145/357369.357371

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

K. G. Shin, T. Lin, and Y. Lee, Optimal Checkpointing of Real-Time Tasks, IEEE Transactions on Computers, vol.36, issue.11, p.36, 1987.
DOI : 10.1109/TC.1987.5009472

P. G. Sorenson, A methodology for real-time system development, Canada, 1974.

M. Spuri, Analysis of deadline scheduled real-time system. Rapport technique, 1996.

A. Srinivasan and J. Anderson, Fair scheduling of dynamique task systems on multiprocessors, Journal of Systems and Software, 2003.

A. Srinivasan and J. Anderson, Optima rate-based scheduling on multiprocessors

A. Srinivasan and S. Baruah, Deadline-based scheduling of periodic task systems on multiprocessors, Information Processing Letters, vol.84, issue.2, 2002.
DOI : 10.1016/S0020-0190(02)00231-4

A. Srinivasan, P. Holman, and J. Anderson, Integrating aperiodic and recurrent tasks on fair-scheduled multiprocessors, 14th Euromicro Conference on Real- Time Systems, pp.19-21, 2002.

J. A. Stankovic, M. Spuri, M. D. Natale, and G. Buttazzo, Implications of classical scheduling results for real-time systems, Computer, vol.28, issue.6, pp.16-25, 1995.
DOI : 10.1109/2.386982

J. A. Stankovoc, K. Ramamritham, D. Niehaus, M. Humphrey, and G. Wallace, The Spring System: Integrated Support for Complex Real-Time Systems, 1998.
DOI : 10.1007/978-1-4615-5041-9_4

P. Starke, Some properties of timed petri nets under te earliest firing rule, Advances in Petri nets '90, 1990.

K. Tindell, A. Burns, and A. J. Wellings, Allocating hard real-time tasks: An NP-Hard problem made easy, Real-Time Systems, vol.33, issue.3, pp.145-165, 1992.
DOI : 10.1007/BF00365407

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

H. Tokuda, T. Nakajima, and P. Rao, Real-time mach :toward a predictable real-time system, Proceedings of USENIX Mach Workshop, pp.73-82, 1990.

Y. Wang, Y. Huang, K. Vo, P. Chung, and C. Kintala, Checkpointing and its applications, Proc. 25th Fault-Tolerant Computing Symposium, pp.22-31, 1995.

Y. Wang and K. J. Lin, Providing real-time support in the linux kernel, proceedings of the IEEE International Conference on Real-Time Computing Systems and Applications, p.1, 1999.

J. Xu, Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations, IEEE Transactions on Software Engineering, vol.19, issue.2, pp.139-153, 1993.
DOI : 10.1109/32.214831