Abstract
Methods of linear complexity are proposed for finding the minimum total time required for performing a given amount of computations in various modes of synchronous interaction of distributed heterogeneous concurrent processes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Korolev, L.N.,Struktury EVM i ikh matematicheskoe obespechenie (Computer Architecture and Software), Moscow: Nauka, 1978.
Voevodin, V.V.,Matematicheskie osnovy parallel'nykh vychislenii (Mathematical Foundations of Parallel Computing), Moscow: Izd. Mosk. Univ., 1991.
Ivannikov, V.P. and Gaisaryan, S.S., Characteristics of Programming Systems for Vector-Pipeline Computers,Kibernetika i vychislitel'naya tekhnika (Cybernetics Computing), Mel'nikov, V.A., Ed., Moscow: Nauka, 1986, issue 2, pp. 3–17.
Kapitonova, Yu.V. and Kovalenko, N.S., On Distributing Resources among Concurrent Processes,Kibernetika, 1981, no. 3, pp. 17–20.
Ferrari, D.,Computer Systems Performance Estimation, Englewood Cliffs: Prentice Hall, 1978. Translated under the titleOtsenka proizvoditel'nosti vychislitel'nykh sistem, Moscow: Mir, 1981.
Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A.,Teoriya raspisanii: Mnogostadiinye sistemy (Scheduling Theory: Multistage Systems), Moscow: Nauka, 1989.
Kovalenko, N.S. and Metel'skii, V.M., Interaction Modes of Heterogeneous Distributed Concurrent Processes,Kibernetika i Sistemnyi Analiz, 1997, no. 3, pp. 31–43.
Rights and permissions
About this article
Cite this article
Ivannikov, V.P., Kovalenko, N.S. & Metel'skii, V.M. On the minimal time required for execution of distributed concurrent processes in synchronous modes. Program Comput Soft 26, 268–274 (2000). https://doi.org/10.1007/BF02759320
Issue Date:
DOI: https://doi.org/10.1007/BF02759320