On one method of static concurrence of cascaded programs

The paper is concerned with static concurrence of cascaded programs represented in an information-logic graph. Program statements are indicated which are bound to be executed in parallel. Statements for which is not the case are allocated to branches of a parallel programs; indications given as to feasibility or otherwise of parallel execution for these branches. Rules for branch generation are given. The method is suitable for associative data processing for which the algorithm complexity is estimated.