Abstract
Efficiency and optimality criteria of block structurization of software resources taking account of overhead expenses is obtained for a class of uniformly distributed competing processes.
Similar content being viewed by others
References
Yu. V. Kapitonova and A. A. Letichevskii, Mathematical theory of computer system design [in Russian], Nauka, Moscow (1988).
Yu. V. Kapitonova, N. S. Kovalenko, and M. I. Ovseets, “Efficiency of pipelining of competing processes when the number of program copies is limited,” Kibernetika, No. 3, 60–65 (1989).
S. A. Krasnov, “Transputers, transputer systems, and OCCAM,” Computing Processes and Systems, No. 7, 3–93 (1990).
N. S. Kovalenko and V. M. MeteFskii, “Execution time of competing processes in distribution processing,” Kibern. Sist. Anal., No. 1, 54–64 (1996).
Yu. V. Kapitonova and M. I. Ovseets, “An optimal pooling algorithm for linearly structured programs,” Kibernetika, No. 1, 5–8 (1986).
Author information
Authors and Affiliations
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 59–62, November–December, 1999.
Rights and permissions
About this article
Cite this article
Kovalenko, N.S., Metel’skii, V.M. Optimality of software resource structurization in distributed processing. Cybern Syst Anal 35, 892–894 (1999). https://doi.org/10.1007/BF02742280
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742280