M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, American Journal of Physics, vol.34, issue.2, 1970.
DOI : 10.1119/1.1972842

N. C. Audsley, Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, 1991.

N. C. Audsley, On priority assignment in fixed priority scheduling, Information Processing Letters, vol.79, issue.1, pp.39-44, 2001.
DOI : 10.1016/S0020-0190(00)00165-4

R. Brito and N. Navet, Low-power round-robin scheduling, Proc. of the 12th international conference on real-time systems, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099959

L. George, N. Rivierre, and M. Spuri, Preemptive and non-preemptive real-time uniprocessor scheduling, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073732

M. Grenier and N. Navet, Scheduling configuration on Posix 1003.1b systems, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00152312

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

J. Migge, A. Jean-marie, and N. Navet, Timing analysis of compound scheduling policies : Application to Posix1003.1b, Journal of Scheduling, vol.6, issue.5, pp.457-482, 2003.
DOI : 10.1023/A:1024806606443
URL : https://hal.archives-ouvertes.fr/inria-00099506

N. Navet and J. Migge, Fine tuning the scheduling of tasks through a genetic algorithm: application to Posix1003.1b compliant systems, Proc. of IEEE Proceedings Software, pp.13-24, 2003.
DOI : 10.1049/ip-sen:20030205
URL : https://hal.archives-ouvertes.fr/inria-00099503