Email this article An Algorithm for Constructing Single Processor Static–Dynamic Schedules
- Authors: Kostenko V.A.1, Smirnov A.S.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 42, No 1 (2018)
- Pages: 44-50
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176220
- DOI: https://doi.org/10.3103/S0278641918010053
- ID: 176220
Cite item
Open Access
Access granted
Subscription Access
Abstract
An extended approach is proposed for using algorithms to find the maximum flow in a transport network when constructing schedules for performing work with interruptions in a new class of problems of creating static–dynamic schedules. This is accomplished by projecting realtime systems with the architecture of integrated module avionics. The results from an experimental study confirm the high accuracy of the proposed algorithm.
About the authors
V. A. Kostenko
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: kost@cs.msu.su
Russian Federation, Moscow, 119991
A. S. Smirnov
Faculty of Computational Mathematics and Cybernetics
Email: kost@cs.msu.su
Russian Federation, Moscow, 119991
Supplementary files
