Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Partitioned Scheduling of Recurrent Real-Time Tasks
Pontus Ekberg (Uppsala University), Sanjoy Baruah (Washington University in St. Louis)
IEEE Real-Time Systems Symposium (RTSS)
DOI: 10.1109/rtss52674.2021.00040 (Computer Science)
Licence : non indiquée (tous droits réservés)
Résumé : The partitioned scheduling of periodic and sporadic task systems upon multiprocessor platforms (both identical and heterogeneous) is considered. The computational complexity of a large number of such partitioned schedulability problems is examined. New lower and upper bounds on complexity are presented for several problems. Some problems are pigeonholed into their precise complexity classes in this way. A list of problems for which exact classification remains open is compiled.
Publié le 01 Déc. 2021