[LEU 82] J.Y.T. Leung and J. Whitehead. On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks Performance Evaluation 2, 237-250 (1982).


[BUR 94] A. Burchard and J. Liebeherr and Y. Oh and S. H. Son Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems . Technical Report CS-94-01, University of Virginia, 1994 Department of Computer Science.


[SON 93] Y. Oh and S. H. Son Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem . Technical Report CS93-24, University of Virginia, 1993 Department of Computer Science.


[JEF 91] K. Jeffay, D. F. Stanat, C. U. Martel. On Non-Preemptive Scheduling of Periodic and Sporadic Tasks . In the Proceedings of the RTSS91 Real Systems Symposium. San Antonio, Texas. December 1991.


[ALD 98] S. A. Aldarmi, A. Burns. Dynamic Value-Density For Scheduling Real-Time Systems . November 1998, Real Time System Group, University of York, Technical Report number YCS-98-310.

[STA 95] J. A. Stankovic, M Spuri, M. Di Natale, G. Buttazzo. Implications of Classical Scheduling Results For Real Time Systems . IEEE Computer, vol 28, number 6, pages 16-25. June, 1995.

[LEG 03a] J. Legrand, F. Singhoff, L. Nana, L. Marcé, F. Dupont and H. Hafidi Faisabilité d'une application de supervision : le projet IRMA . Real Time and embedded System'03, Paris, Avril 2003.

[ARI 97] Arinc Committee. Avionics Application Software Standard Interface . January 1, 1997.

[AUD 95] N. Audsley. Real Time Scheduling . Predictable Depdendable Systems, vol 2, chapter 2, Part II.

[BUR 97] A. Burns and A. Wellings. Real-time Systems and Programming Languages. Addison Wesley, 1997.

[COT 00] F. Cottet, J. Delacroix, C. Kaiser and Z. Mammeri. Ordonnancement temps réel. Hermès, 2000.

[DEM 99] I. Demeure and C. Bonnet. Introduction aux systèmes temps réel. Collection pédagogique de télécommunications, Hermès, Septembre 1999.

[KRI 97] C. M. Krishna and K. G.Shin. Real-Time Systems. Mc Graw-Hill International Editions, 1997.

[RIV 98] Rivierre Nicolas. Ordonnancement temps réel centralisé, les cas préemptifs et non préemptifs. Thèse de doctorat de l'Université de Versailles-Saint Quentin. Février 1998.

[GEO 96] L. George, N. Rivierre and M. Spuri. Preemptive and Non-Preemptive Real Time Uni-Processor Scheduling. INRIA Research Report number 2966. September 1996.

[TIN 94] K. Tindell and J. Clark. Holistic Schedulability Analysis for Distributed Hard Real-Time Systems. Microprocessing and Microprogramming 40:117-134. 1994.

[SHA 90] Sha, R. Rajkumar and J.P. Lehoczky. Priority Inheritance Protocols : An Approach to Real Time Synchronization. IEEE Transactions on computers, 39(9):1175-1185. 1990."

[LEG 03] J. Legrand, F. Singhoff, L Nana, L. Marcé, F. Dupont and H. Hafidi. About Bounds of Buffers Shared by Periodic Tasks : the IRMA project. In the 15th IEEE Euromicro, WIP Real Time Systems Conference, 2003.

[BLA 76] J. Blazewicz. Scheduling dependant tasks with Different Arrival Times to Meet Deadlines. In. Gelende H. Beilner (eds), Modeling and Performance Evaluation of Computer Systems,. Amsterdam 1976

[CHE 90] H. Chetto, M. Silly and T. Bouchentouf. Dynamic Scheduling of Real Time Tasks Under Precedence Constraints. RTS International Journal of Time Critical Computing Systems. 2(3):181-194, September 1990.

[OVE 97] E. Overton, T. Brylawski, J. Anderson, A Foray into Uniprocessor Real Time Scheduling Algorithms and Intractibility . December, 1997. Technical Report.