Using Solvable Real Time Classes for Jitter-Minimized Planning

An approach to scheduling a computational process in distributed real-time systems with minimization of the jitter at the moment of starting or completing a task from period to period is considered. The approach is based on the concept of a solvable class of systems for which there are optimal sched...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer & systems sciences international 2021-11, Vol.60 (6), p.895-903
Hauptverfasser: Gruzlikov, A. M., Kolesov, N. 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 minimization of the jitter at the moment of starting or completing a task from period to period is considered. The approach is based on the concept of a solvable class of systems for which there are optimal scheduling algorithms of polynomial complexity.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230721060101