Abstract
A mathematical model of pipelining of competing processes is constructed and analyzed. Formulas are derived for the total execution time of pipelined programs. Criteria are suggested for efficiency and optimality of pipelining. The acceleration and efficiency ratios are investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
Yu. V. Kapitonova and N. S. Kovalenko, “On allocation of resources to competing processes,” Kibernetika, No. 3, 17–20 (1981).
Yu. V. Kapitonova, N. S. Kovalenko, and M. I. Ovseets, “On efficiency and optimality of one method of allocation of programs in multiprocessor computing systems,” Kibernetika, No. 6, 23–27 (1983).
Yu. V. Kapitonova, P. S. Klyaus, and N. S. Kovalenko, “On optimal organization of one class of parallel processes,” Programirovanie, No. 4, 48–56 (1984).
M. I. Ovseets, “Minimizing the number of processors in implementation of homogeneous competing processes,” Dokl. Akad. Nauk BSSR,29, No. 12, 1082–1085 (1985).
Additional information
Translated from Kibernetika, No. 3, pp. 60–65, May–June, 1989.
Rights and permissions
About this article
Cite this article
Kapitonova, Y.V., Kovalenko, N.S. & Ovseets, M.I. Efficiency of pipelining of competing processes when the number of program copies is limited. Cybern Syst Anal 25, 358–364 (1989). https://doi.org/10.1007/BF01069992
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069992