In the article is proposed a method solution of the problem minimization length topological tract of signals passing from the processors matrix location boolean equations system at programmable unlimited systems. This method is useful, when it is need to use maximally parallel and conveyor operating modes of multiprocessor to get solution of the problem in the shortest possible time. There are topology and mathematical models of processor structure. Dignities and shortcomings of method are analyzed. There are outlined perspectives of discovery at this direction.
multiprocessor, sequencer, Programmable Unlimited Systems, planar structure, wave algorithm, Boolean equations system, graph, minimization of path in the graph
"Minimizatsiia dliny topologicheskikh putei prokhozhdeniia signalov po matritse protsessorov pri razmeshchenii sistemy bulevykh uravnenii v Programmable Unlimited Systems" [Minimization of topological path length of signals passing trough the processors matrix in the process of boolean equations system location at Programmable Unlimited Systems],
Science and Technology of the Air Force of Ukraine,