Algorithm of comparative estimation of complications of exchange by reports during fragmentation of temporal parallel models of tasks for dcn

In the article the algorithm of comparative estimation of complications of exchange is presented by reports during fragmentation of temporal parallel models of tasks for DCN. The comparative estimation of efficiency of fragmentation is given on the basis of two approaches: application of logic of setting of operators on free in present moment to time of CK and decision of task of setting of fragments of task on CK of network with the use of formal polynomials. An algorithm is illustrated on the example of one of test problems of Livermor of cycles.
Keywords:
parallel timeparametrized model of task, DCN, calculable knot (CK), structures of semantiko-numerical specification (SNS), formal polynomial, complication of fragmentation (amount of exchanges by reports)