Email this article Schedulability Analysis for Strictly Periodic Tasks in RTOS
- Authors: Zelenova S.A.1, Zelenov S.V.1,2
-
Affiliations:
- Ivannikov Institute for System Programming
- National Research University Higher School of Economics
- Issue: Vol 44, No 3 (2018)
- Pages: 159-169
- Section: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176605
- DOI: https://doi.org/10.1134/S0361768818030076
- ID: 176605
Cite item
Open Access
Access granted
Subscription Access
Abstract
A new look at the problem of constructing a scheduler in the case of a group of strictly periodic tasks is proposed. The structure of the system of periods is represented in terms of graph theory. A criterion for the existence of a conflict-free schedule based on this representation is obtained, and generic schemes of algorithms for constructing such a schedule are described. The proposed approach is illustrated by building schedules for a number of strictly periodic tasks.
About the authors
S. A. Zelenova
Ivannikov Institute for System Programming
Author for correspondence.
Email: sophia@ispras.ru
Russian Federation, Moscow, 109004
S. V. Zelenov
Ivannikov Institute for System Programming; National Research University Higher School of Economics
Email: sophia@ispras.ru
Russian Federation, Moscow, 109004; Moscow, 101000
