Abstract
The task of composition of schedules without interrupts and switching for optimal performance in multiprocessor automated control systems was considered. The series of exact and approximated algorithms based on aggregation method was developed. Efficiency and application area of the algorithms was defined, their comparative analysis was made.
Similar content being viewed by others
References
Sigal, I.H., Zadacha kommivoyazhora bol’shoy razmernosti (Travelling Salesman Problem of Big Dimension), Moscow: Vychisl. Tsentr Akad. Nauk SSSR, 1986.
Sigal, I.H. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirocanie (Introduction into Applied Discret Programming), Moscow: Fizmatlit, 2002.
Ledak, L.P. and Sushkov, B.G., An Optimal Aggregation in the Task of One Set, in Nekotorye algoritmy planirovaniya vychisleniy v determimirovannykh sistemakh real’nogo vremeni (Some Algorithms of Computation Planning in Determined Real-Time Systems), Sushkov, B.G., Ed., Moscow: Vychisl. Tsentr Akad. Nauk SSSR, 1986, pp. 4–9.
Guz, D.S., Krasovsky, D.V., and Furugyan, M.G., Effektivnye algorithmy planirovaniya vychisleniy v mnogoprotsessornykh sistemakh real’nogo vremeni (Efficient Algorithms of Computation Planning in the Multiprocessor Real-Time Systems), Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 2004.
Author information
Authors and Affiliations
Additional information
Original Russian Text © D.V. Krasovskii, M.G. Furugyan, 2006, published in Avtomatika i Telemekhanika, 2006, No. 12, pp. 205–211.
Rights and permissions
About this article
Cite this article
Krasovskii, D.V., Furugyan, M.G. Aggregation in the task of composition of the optimal schedule for multiprocessor automated control systems. Autom Remote Control 67, 2051–2056 (2006). https://doi.org/10.1134/S0005117906120162
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0005117906120162