Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
K. V. Shakhbazyan and T. A. Tushkina, “A branch-and-bound method for a parallel sequencing problem,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,35, 146–155 (1973).
K. V. Shakhbazyan, T. A. Tushkina, V. S. Sokhranskaya, and L. M. Tovkach, “An experiment to realize multiprocessor dispatching algorithms,” USiM, No. 3, 84–85 (1975).
K. V. Shakhbazyan, T. A. Tushkina, and V. S. Sokhranskaya, “Statistical tests of various multiprocessor dispatching methods,” Programmirovanie, No. 4, 91–99 (1976).
V. S. Sokhranskaya and T. A. Tushkina, “Parallelism of computations with cycles and branching points,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,90, 210–225 (1979).
D. F. Martin and G. Estring, “Experiments on models of computations and systems,” IEEE Trans., Comput.,EC-16, No. 1, 59–69 (1967).
D. F. Martin and G. Estring, “Path length computations on graph models of computations,” IEEE Trans., Comput.,C-18, No. 6, 530–536 (1969).
V. E. Kotov, “The theory of parallel programming. Applied aspects,” Kibernetika, No. 1, 1–16 (1974).
A. V. Maksimenkov and A. L. Shchers, “Scheduling of standard jobs,” Programmirovanie, No. 1, 77–83 (1978).
Additional information
Translated form Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 111, pp. 162–176, 1981.
Rights and permissions
About this article
Cite this article
Sokhranskaya, V.S., Tushkina, T.A. An experiment with parallel processing of computational processes modeled by bilogic graphs. J Math Sci 24, 107–117 (1984). https://doi.org/10.1007/BF01230272
Issue Date:
DOI: https://doi.org/10.1007/BF01230272