Abstract:
Consideration was given to a scheme for solving the extremal routing problem constrained by the precedence conditions and based on a modification of the dynamic programming method. Attention was focused on an issue related with parallelization of the procedure of constructing the Bellman function layers. A hypothetical construction for distribution of the space of positions between the processors such that they can run without any data exchange until the final stage of computations was proposed.
Presented by the member of Editorial Board:A. I. Kibzun