Using solvable classes of systems for scheduling of real-time computations with minimized jitter

An approach to scheduling a computational process in distributed real-time systems with jitter minimization is considered. The approach is based on the concept of a solvable class of systems for which there exist optimal scheduling algorithms of polynomial complexity.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series 2021-05, Vol.1864 (1), p.12021
Hauptverfasser: Gruzlikov, A.V., Kolesov, N.V., Tolmacheva, M.V.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An approach to scheduling a computational process in distributed real-time systems with jitter minimization is considered. The approach is based on the concept of a solvable class of systems for which there exist optimal scheduling algorithms of polynomial complexity.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1864/1/012021