Design and architecture of real-time operating system
Proceedings of the Institute for System Programming of the RAS. 2016. Vol. 28. No. 2. P. 181-192.
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.