Models of parallel computation in solution of extremal combinatorial problems in rearrangeable uniform arrays with a common memory field

Various strategies are analyzed that are employed in organizing the computing process for solution of extremal combinatorial problems in a multiprocessor system with a common memory field. Formal statements of this approach, their analysis, and results of experimental testing are given.