Research indexJournal article
An Algorithm for Constructing Single Processor Static–Dynamic Schedules
Kostenko, Смирнов
Moscow University Computational Mathematics and Cybernetics1 Jan 2018
NobleIDark:/48914/w1/20260522/48D622EDDOI10.3103/s0278641918010053
An Algorithm for Constructing Single Processor Static–Dynamic Schedules
Kostenko, Смирнов · Moscow University Computational Mathematics and Cybernetics · 2018 · Subscription
NobleIDark:/48914/w1/20260522/48D622EDDOI10.3103/s0278641918010053
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
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.