Introduction à l'ordonnancement temps réel multiprocesseur

Ce document constitue une courte introduction aux problèmes (et solutions) d’ordonnancement temps réel multiprocesseur. Cette introduction n’est certainement pas un exposé exhaustif sur cette thématique ; mais bien un aperçu des fondements théoriques de cette jeune discipline. Enfin, nous montrons dans ce document qu’à plusieurs points de vue les solutions aux problèmes d’ordonnancement multiprocesseur ne sont pas d’élémentaires extensions des solutions monoprocesseurs.

[1]  Sanjoy K. Baruah,et al.  Deadline-based scheduling of periodic task systems on multiprocessors , 2002, Inf. Process. Lett..

[2]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[3]  Liliana Cucu-Grosjean,et al.  Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[4]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[5]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[6]  Daniel F. García,et al.  Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling , 2004, Real-Time Systems.

[7]  Nicolas Navet Systèmes temps réel 2 - Ordonnancement, réseaux et qualité de service , 2006 .

[8]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[9]  Liliana Cucu-Grosjean,et al.  Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[10]  Joseph Y.-T. Leung,et al.  Handbook of Real-Time and Embedded Systems , 2007 .

[11]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[12]  Michael L. Dertouzos,et al.  MULTIPROCESSOR SCHEDULING IN A HARD REAL-TIME ENVIRONMENT. , 2017 .

[13]  Campus de Viesques,et al.  Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems , 2000 .

[14]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[15]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[16]  Lawrence Jenkins,et al.  Utilization Bounds for RM Scheduling on Uniform Multiprocessors , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).