An experiment with parallel processing of computational processes modeled by bilogic graphs

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).