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.47-61, 1973.

J. Y. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, issue.4, pp.237-250, 1982.
DOI : 10.1016/0166-5316(82)90024-4

R. I. Davis and A. Burns, Robust Priority Assignment for Fixed Priority Real-Time Systems, 28th IEEE International Real-Time Systems Symposium (RTSS 2007), pp.3-14, 2007.
DOI : 10.1109/RTSS.2007.11

M. Bertogna, Evaluation of Existing Schedulability Tests for Global EDF, 2009 International Conference on Parallel Processing Workshops, pp.11-18, 2009.
DOI : 10.1109/ICPPW.2009.12

A. Burchard, J. Liebeherr, Y. Oh, 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.
DOI : 10.1109/12.477248

Y. Oh and S. H. Son, Allocating fixed-priority periodic tasks on multiprocessor systems, Real-Time Systems, vol.1, issue.9, pp.207-239, 1995.
DOI : 10.1007/BF01088806

B. Andersson and J. Jonsson, Preemptive multiprocessor scheduling anomalies, Proceedings 16th International Parallel and Distributed Processing Symposium, pp.12-19, 2002.
DOI : 10.1109/IPDPS.2002.1015483

N. W. Fisher, S. K. Baruah, and T. P. Baker, The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities, 18th Euromicro Conference on Real-Time Systems (ECRTS'06), pp.118-127, 2006.
DOI : 10.1109/ECRTS.2006.30

K. Lakshmanan, R. Rajkumar, and J. P. Lehoczky, Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors, 2009 21st Euromicro Conference on Real-Time Systems, pp.239-248, 2009.
DOI : 10.1109/ECRTS.2009.33

P. Dibble, Jsr 1: Real-time specification for java, 1998.

L. Bougueroua, L. George, and S. Midonnet, Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF, Second International Conference on Systems (ICONS'07), p.8, 2007.
DOI : 10.1109/ICONS.2007.18

URL : https://hal.archives-ouvertes.fr/hal-00620257

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

R. I. Davis, A. Zabos, and A. Burns, Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems, IEEE Transactions on Computers, vol.57, issue.9, pp.1261-1276, 2008.
DOI : 10.1109/TC.2008.66

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

C. Jr, E. G. Garey, M. R. Johnson, and D. S. , Approximation algorithms for bin packing: A survey In: Approximation Algorithms for NP-Hard Problems, pp.46-93, 1996.

N. C. Audsley, B. Alan, K. W. Tindell, and A. J. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993.
DOI : 10.1049/sej.1993.0034

E. Bini and G. C. Buttazzo, Biasing effects in schedulability measures, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004., pp.196-203, 2004.
DOI : 10.1109/EMRTS.2004.1311021