Abstract
Methods are proposed for finding an optimal number of processors that provide realization of a preassigned amount of calculations in a directive and a minimal time in the asynchronous mode of interaction of competing processes using a sufficient or a limited number of processors in multiprocessor systems.
Similar content being viewed by others
REFERENCES
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevsky, “Efficiency of parallel computations with limited resources,” Dokl. Akad. Nauk SSSR, 254, No. 3, 527-530 (1980).
A. Ye. Doroshenko, Mathematical Models and Methods of Organization of High-Performance Parallel Computations [in Russian], Naukova Dumka, Kiev (2000).
Yu. V. Kapitonova and N. S. Kovalenko, “A method of structurization of program resources in organizing parallel computations,” in: Proc. IVth All-Union Symposium on System and Theoretical Programming, Shtiintsa, Kishinev (1983), pp. 183-185.
M. I. Ovseyets, “Minimization of the number of processors in realizing homogeneous competing processes,” Dokl. AN BSSR, No. 12, 1082-1085 (1985).
N. S. Kovalenko and V. M. Metelsky, “Execution time of competing processes in distributed processing,” Kibern. Sist. Anal., No. 1, 54-64 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kovalenko, N.S., Metelsky, V.M., Samal', S.A. et al. Optimization of the Number of Processors in Realizing Nonhomogeneous Distributed Competing Processes. Cybernetics and Systems Analysis 39, 901–908 (2003). https://doi.org/10.1023/B:CASA.0000020232.49474.69
Issue Date:
DOI: https://doi.org/10.1023/B:CASA.0000020232.49474.69