C. Neil, . Audsley, A. Burns, K. W. Tindell, and A. J. Wellings, Il est possible de fixer une certaine analogie entre les classes d'algorithmes d'attri- Applying new scheduling theory to static priority pre-emptive schedu- ling

A. Björn, A. Konstantinos, B. Sanjoy, and K. , BARUAH : Scheduling arbitrary-deadline sporadic task systems on multiprocessors, Proceedings of the 29th IEEE Real-Time Systems Symposium (RTSS), pp.284-292, 1993.

J. H. Anderson, B. Vasile, and C. Umamaheswari, DEVI : An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
DOI : 10.1007/s11241-007-9035-0

A. Björn, A. Sanjoy, K. Baruah, and J. Jan, Static-priority scheduling on multiprocessors, Real-Time Systems Proceedings of the 22nd IEEE Real-Time Systems Symposium (RTSS), pp.85-131, 2001.

A. Björn and J. Jan, Preemptive multiprocessor scheduling anomalies, Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS), pp.12-19, 2002.

H. James, . Anderson, and S. Anand, Early-release fair scheduling, Proceedings of the 12th Euromicro Conference on Real-time Systems (ECRTS), pp.35-43, 2000.

A. Neil and C. , AUDSLEY : On priority assignment in fixed priority scheduling, Information Processing Letters, vol.79, pp.39-44, 2001.

B. Björn, J. H. Brandenburg, and . Anderson, An implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP real-time synchronization protocols in LIT

P. Theodore and . Baker, Stack-based scheduling of realtime processes. Real-Time Systems, pp.67-99, 1991.

P. Theodore and . Baker, Multiprocessor EDF and deadline monotonic schedulability analysis, Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS), pp.120-129, 2003.

P. Theodore and . Baker, Comparison of empirical success rates of global vs. partitioned fixedpriority and EDF scheduling for hard real time, 2005.

K. Sanjoy and . Baruah, Techniques for multiprocessor global schedulability analysis, Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS), pp.119-128, 2007.

B. Enrico and G. C. Buttazzo, Biasing effects in schedulability measures, Proceedings of the 16th Euromicro Conference on Real-time Systems (ECRTS), pp.196-203, 2004.

B. Alan, K. Sanjoy, and . Baruah, Sustainability in real-time scheduling, Journal of Computing Science and EngineeringJCSE), vol.2, issue.1, pp.74-97, 2008.

P. Theodore, . Baker, and K. Sanjoy, BARUAH : An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems

P. Theodore, . Baker, K. Sanjoy, and . Baruah, Sustainable multiprocessor scheduling of sporadic task systems, Proceedings of the 21st Euromicro Conference on Real-time Systems (ECRTS), pp.141-150, 2009.

K. Sanjoy, . Baruah, B. Vincenzo, M. Alberto, and S. Sebastian, Improved multiprocessor global schedulability analysis. Real-Time Systems, BC03] Sanjoy K. BARUAH et John CARPENTER : Multiprocessor fixed-priority scheduling with restricted interprocessor migrations, pp.3-24, 2010.

B. Marko and C. Michele, Response-time analysis for globally scheduled symmetric multiprocessor platforms

B. Marko, C. Michele, and L. Giuseppe, Schedulability analysis of global scheduling algorithms on multiprocessor platforms

K. Sanjoy, N. K. Baruah, C. Cohen, P. Gregory, and D. A. , VARVEL : Proportionate progress : A notion of fairness in resource allocation

B. Enrico, D. Marco, G. C. Natale, and . Buttazzo, Sensitivity analysis for fixed-priority real-time systems, Proceedings of the 18th Euromicro Conference on Real-time Systems (ECRTS), pp.13-22, 2006.

B. Marko, Real-Time Scheduling Analysis for Multiprocessor Platforms

K. Sanjoy, N. Baruah, and F. Wayne, Global fixed-priority scheduling of arbitrary-deadline sporadic task sys- tems

B. Lamine, G. Laurent, and M. Serge, Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF

A. David, B. Hennadiy, L. Björn, B. Brandenburg, and J. H. Anderson, A flexible real-time locking protocol for multiprocessors, Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pp.47-56, 2007.

B. Almut, L. Jörg, O. Yingfeng, and S. H. Son, New strategies for assigning real-time tasks to multiprocessor systems, IEEE Transactions on Computers, vol.44, issue.12, pp.1429-1442, 1995.

K. Sanjoy, A. Baruah, M. Ka-lau, and E. Louis, ROSIER : Preemptively scheduling hard-real-time sporadic tasks on one processor, Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS), pp.182-190, 1990.

C. Sébastien, C. Liliana, and G. Joël, Integrating job parallelism in real-time scheduling theory, Information Processing Letters, vol.106, issue.5, pp.180-187, 2008.

C. John, S. Hyatt, F. , P. Holman, A. Srinivasan et al., BARUAH : Handbook of Scheduling : Algorithms, Models, and Performance Analysis, chapitre A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms, pp.30-31

H. /. Chapman, B. Crc, F. Raton, C. Liliana, and G. Joël, Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors, 2004.

C. Antoine and P. Isabelle, Worst-case execution time analysis of the RTEMS real-time operating sys- tem

C. Hyeonjoong, R. Binoy, E. Douglas, and J. , An optimal real-time scheduling algorithm for multiprocessors, Proceedings of the 27th IEEE Real-Time Systems Symposium (RTSS), pp.101-110, 2006.

[. Ian, D. Alan, B. Ian, D. , and A. Burns, Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems Robust priority assignment for fixed priority real-time systems, Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS), pp.249-254, 1995.

[. Ian, D. , and A. Burns, Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

[. Ian, D. , and A. Burns, FPZL schedulability analysis, Real-Time Systems Proceedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp.1-40, 2010.

D. Sadegh and K. Sudarshan, DHALL : An on line algorithm for real-time tasks allocation, Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS), pp.194-200, 1986.

[. Leonidas and D. , Control robotics : The procedural control of physical processes, Proceedings of IFIP Congress 74, pp.807-813, 1974.

K. Sudarshan, C. Dhall, and L. Laung, On a real-time scheduling problem, Operations Research, vol.26, issue.1, pp.127-140, 1978.

M. Leonidas, D. , A. Ka-lau, and M. , Multiprocessor on-line scheduling of hard-real-time tasks, IEEE Transactions on Software Engineering, vol.15, issue.12, pp.1497-1506, 1989.

D. Marco, . Natale, and A. John, STANKOVIC : Applicability of simulated annealing methods to real-time scheduling and jitter control

[. Hyatt, F. Sanjoy, and K. , BARUAH : Restricting EDF migration on uniform heterogeneous multiprocessors. TSI. Technique et science informatiques, pp.917-938, 2005.

[. Wayne, F. , T. P. Baker, and K. Sanjoy, BARUAH : Algorithms for determining the demand-based load of a sporadic task system

[. Wayne, F. Sanjoy, K. Baruah, and T. P. Baker, The partitioned scheduling of sporadic tasks according to static- priorities

F. Frédéric, M. Serge, and G. Laurent, Allowance-fit : A partitioning algorithm for temporal robustness of hard real-time systems upon multiprocessors

F. Frédéric, M. Serge, and G. Laurent, A robust partitioned scheduling for real-time multiprocessor systems, Proceedings of the 7th IFIP TC 10 Working Conference on Distributed and Parallel Embedded Systems (DIPES), pp.193-204, 2010.

F. Frédéric, M. Serge, and G. Laurent, Robust partitioned scheduling for static-priority real-time multiprocessor systems with shared resources

F. Frédéric, M. Serge, and G. Laurent, Laxity-based restricted-migration scheduling, Proceedings of the 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), p.8, 2011.

F. Frédéric, M. Serge, and Q. Manar, Partitioned scheduling of parallel real-time tasks on multiprocessor sys- tems

F. Dario, T. Michael, and C. Fabio, An implementation of the earliest deadline first algorithm in linux, Proceedings of 24th ACM Symposium on Applied Computing (SAC), pp.1984-1989, 2009.

G. Joël and B. Vandy, Gang FTP scheduling of periodic and parallel rigid real-time tasks, Proceedings of the 18th Real-Time and Network Systems (RTNS), pp.189-196, 2010.

G. Laurent, C. Pierre, and S. Yves, Job vs. portioned partitioning for the earliest deadline first semipartitioned scheduling

G. Joël and D. Raymond, The non-optimality of the monotonic priority assignments for hard realtime offset free systems, Journal of Systems Architecture, vol.57, issue.5, pp.518-535, 2011.

G. Laurent and G. , Etat de l'art sur la robustesse temporelle des systèmes temps-réel mono- processeur, Real-Time Systems, pp.107-126, 1997.

G. Joël, S. Hyatt, F. Sanjoy, and K. , BARUAH : Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Systems, Journal Européen des Systèmes Automatisés, pp.1135-1160187, 2003.

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

G. Paolo, L. Giuseppe, D. Marco, and . Natale, Minimizing memory utilization of real-time task sets in single and multiprocessor systems-on-a-chip

G. Laurent, R. Nicolas, and S. Marco, Preemptive and non-preemptive real-time uniprocessor scheduling, 1996.

G. Nan, S. Martin, Y. Wang, and Y. Ge, Fixed-priority multiprocessor scheduling with liu & layland's utilization bound

H. Hl94-]-rhan and J. W. Liu, Validating timing constraints in multiprocessor and distributed real-time systems

J. Mathai, K. Paritosh, and . Pandya, Finding response times in a real-time system, The Computer Journal, vol.29, issue.5, pp.390-395, 1986.

K. Scott, C. D. Gelatt, and P. Mario, VECCHI : Optimization by simulated annealing, Science, vol.220, issue.4598, pp.671-680, 1983.

K. Shinpei and I. Yutaka, Gang EDF scheduling of parallel task systems, Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS), pp.459-468, 2009.

K. Shinpei and Y. Nobuyuki, Portioned static-priority scheduling on multiprocessors, Proceedings of the 22th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.1-12, 2008.

K. Shinpei and Y. Nobuyuki, Semi-partitioned fixed-priority scheduling on multiprocessors, Proceedings of the 15th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp.23-32, 2009.

K. Shinpei and Y. Nobuyuki, Global EDF-based scheduling with laxity-driven priority promotion, Elsevier Journal of Systems Architecture, vol.57, issue.5, pp.498-517, 2011.

K. Shinpei, Y. Nobuyuki, and I. Yutaka, Semi-partitioned scheduling of sporadic task systems on multiproces- sors

M. José, . López, L. José, . Díaz, F. Daniel et al., Utilization bounds for EDF scheduling on real-time multiprocessor sys- tems

[. Kyoon and L. , On-line multiprocessor scheduling algorithms for real-time tasks, Proceedings of the IEEE Region 10's Ninth Annual International Conference (TENCON), pp.607-611, 1994.

[. Leung, A new algorithm for scheduling periodic, real-time tasks, Algorithmica, vol.20, issue.No. 1, pp.209-219, 1989.
DOI : 10.1007/BF01553887

L. Greg, S. Hyatt, F. Ian, P. Scott, and B. , DP-Fair : A simple model for understanding optimal multiprocessor scheduling

M. José, M. López, . García, L. José, . Díaz et al., Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

L. Karthik, K. Shinpei, and . Ragunathan, RAJ) RAJKUMAR : Scheduling parallel real-time tasks on multi-core processors, Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS), pp.259-268, 2010.

C. Laung, L. James, and W. , LAYLAND : Scheduling algorithms for multiprogramming in a hard-real-time envi- ronment

L. Sylvain, M. Rami, and M. Daniel, An efficient RMS admission control and its application to multiprocessor scheduling, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.

[. Yuk-tong, L. Jennifer, and W. , On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, Mas08] Damien MASSON : Intégration des événements non périodiques dans les systèmes temps réel ? Application à la gestion des événements dans la spécification temps réel pour Java, pp.237-250, 1982.

[. Ka-lau and M. , Fundamental Design Problems of Distributed Systems for Hard-Real-Time En- vironments

O. Yingfeng and H. Sang, SON : Tight performance bounds of heuristics for a real-time scheduling pro- blem

O. Yingfeng and S. H. Son, Allocating fixed-priority periodic tasks on multiprocessor systems, Real-Time Systems, vol.9, issue.3, pp.207-239, 1995.

Q. Manar, F. Frédéric, and M. Serge, Performance analysis for segment stretch transformation of parallel realtime tasks

S. Frank, J. Legrand, N. Laurent, and M. Lionel, Cheddar : a flexible real time scheduling framework

S. Lui, R. Ragunathan, and J. P. Lehoczky, Priority inheritance protocols : An approach to real-time synchronization, IEEE Transactions on Computers, vol.39, issue.9, pp.1175-1185, 1990.

A. John, STANKOVIC : Misconceptions about real-time computing : A serious problem for nextgeneration systems, Computer, vol.21, issue.10, pp.10-19, 1988.

T. Ken, A. Burns, and A. J. Wellings, Allocating hard real-time tasks : An NP-hard problem made easy. Real-Time Systems, pp.145-165, 1992.

H. Tabatabaee, Y. Vahid, S. Narges, K. Mahdi, S. Et-amin-milani et al., Exploiting laxity for heterogeneous multiprocessor real-time scheduling, Proceedings of the 3rt International Conference on Information and Communication Technologies : From Theory to Applications (ICTTA), pp.1-6, 2008.

Z. Dakai, M. Daniel, and M. Rami, Multiple-resource periodic scheduling problem: how much fairness is necessary?, Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748), pp.142-151, 2003.
DOI : 10.1109/REAL.2003.1253262

M. Mpcp and . Mpcp, Multiprocessor Priority Ceiling Protocol, MSRP) Multiprocessor Stack Resource Policy. 48, pp.47-51

R. Rbf and . Rbf, Request Bound Function. 79 RM (RM) Rate-Monotonic, RPSA) Robust Partitioning based on Simulated Annealing, pp.37-51

W. Wcet, WCET) durée d'exécution pire cas (Worst Case Execution Time). 5 WF (WF) Worst-Fit, pp.33-35