SYNTHESIS OF MODULAR BLOCK DIAGRAMS FOR AUTOMATIC-CONTROL SYSTEMS

This article considers the problem of synthesizing block diagrams for modular data-processing systems that minimize the total number of references by program modules to database files. The problem is stated as a block-symmetric problem in discrete programming. An effective algorithm is proposed for solution of the problem. The algorithm has polynomial complexity. A numerical example is given.