Open AccessUsing solvable classes of systems for scheduling of real-time computations with minimized jitter
Author(s) -
Alexander Gruzlikov,
Н. В. Колесов,
М. В. Толмачева
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1864/1/012021
Subject(s) - jitter , computer science , computation , scheduling (production processes) , minification , time complexity , fair share scheduling , dynamic priority scheduling , distributed computing , mathematical optimization , computational complexity theory , algorithm , mathematics , quality of service , computer network , telecommunications , programming language
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.