Automation of scheduling for periodic real-time systems

Automation of scheduling for periodic real-time systems

In the paper, we consider the scheduling problem for strictly periodic real-time systems. Strict periodicity means that all release points of all instances of any task must produce an arithmetic progression. Classical scheduling algorithms, such as Earliest Deadline First (EDF) and Rate-Monotonic Sc...

Full description

Bibliographic Details
Main Author: A. V. Tretyakov
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
построение расписаний, системы реального времеени, жесткие периодические задачи, временные ограничения, np-сложная проблема, интегрированная модульная авионика
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/1018

Internet

https://ispranproceedings.elpub.ru/jour/article/view/1018

Similar Items