Abstract
The problem of the optimal arrangement of control modules in a real-time computing system is considered. This problem is formulated as a minimax problem. Various structures of the graph of the partial execution order of applied modules are studied: a sequential chain, several independent sequential chains, a tree oriented from the root to the leaves, a tree oriented from the leaves to the root, and an arbitrary graph without cycles. Algorithms for constructing the optimal arrangement of control modules are developed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Известия Российской академии наук. Теория и системы управления
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
