Geodesic
An experiment with parallel processing of computational processes modeled by bilogic graphs
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part V, Tome 111 (1981), pp. 162-176 
V. S. Sokhranskaya; T. A. Tushkina. An experiment with parallel processing of computational processes modeled by bilogic graphs. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part V, Tome 111 (1981), pp. 162-176. http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a12/
@article{ZNSL_1981_111_a12,
     author = {V. S. Sokhranskaya and T. A. Tushkina},
     title = {An experiment with parallel processing of computational processes modeled by bilogic graphs},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {162--176},
     year = {1981},
     volume = {111},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a12/}
}
TY  - JOUR
AU  - V. S. Sokhranskaya
AU  - T. A. Tushkina
TI  - An experiment with parallel processing of computational processes modeled by bilogic graphs
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1981
SP  - 162
EP  - 176
VL  - 111
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a12/
LA  - ru
ID  - ZNSL_1981_111_a12
ER  - 
%0 Journal Article
%A V. S. Sokhranskaya
%A T. A. Tushkina
%T An experiment with parallel processing of computational processes modeled by bilogic graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 1981
%P 162-176
%V 111
%U http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a12/
%G ru
%F ZNSL_1981_111_a12

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

The article considers the execution of a computational processes represented by a bilogic graph on a homogeneous multiprocessor system (MS). A series of static-dynamic dispatching methods is considered with the aid of simulation. The statistical material is generated by simulating five real processes on MS with different number of processors. The dispatching methods are compared on three levels: efficiency of MS utilization, method complexity, and accuracy of the heuristic method. For an arbitrary program defined by a bilogic graph with unit length operators, a preliminary analysis technique is proposed to select the most appropriate method of parallel processing for the program and the number of processors maximizing the MS utilization efficiency (for BЙSM-6 the corresponding program is available).