论文信息 - Schedulability Analysis for Strictly Periodic Tasks in RTOS

Schedulability Analysis for Strictly Periodic Tasks in RTOS

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.

Sergey V. Zelenov | Sophia A. Zelenova

[1] Nicos Christofides,et al. Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .

[2] O. Ore. Theory of Graphs , 1962 .

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

[4] Patrick Meumeu Yomsi,et al. Schedulability Analysis for non Necessarily Harmonic Real-Time Systems with Precedence and Strict Periodicity Constraints using the Exact Number of Preemptions and no Idle Time , 2008 .

[5] A. V. Tretyakov. Automation of scheduling for periodic real-time systems , 2012 .

[6] Patrick Meumeu Yomsi,et al. Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constraints , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[7] S. V. Zelenov,et al. Non-conflict scheduling criterion for strict periodic tasks , 2017 .

[8] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .

[9] A. A. Zykov,et al. Fundamentals of Graph Theory , 1990 .

[10] Yves Sorel,et al. Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[11] Yves Sorel,et al. Schedulability conditions for non-preemptive hard real-time tasks with strict period , 2010 .