Cybernetics and Systems Analysis

, Volume 32, Issue 1, pp 41–49 | Cite as

Execution time of competing processes in distributed processing

  • N. S. Kovalenko
  • V. M. Metel'skii


Operating System Artificial Intelligence Execution Time System Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. S. Mikhalevich, Yu. V. Kapitonova, and A. A. Letichevskii, “On methods of organization of macropipelined computations”, Kibernetika, No. 3, 3–10 (1986).Google Scholar
  2. 2.
    Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).Google Scholar
  3. 3.
    S. A. Krasnov, “Transputers, transputer computing systems, and Occam”, Vychisl. Prots. Sist., No. 7, 3–93 (1990).zbMATHGoogle Scholar
  4. 4.
    R. Hockney and C. Jesshope, Parallel Computers: Architecture, Programming, and Algorithms [Russian translation], Radio i Svyaz', Moscow (1986).Google Scholar
  5. 5.
    A. P. Chernyaev, “Programming systems for high-performance computers”, in: Computer Science [in Russian], Vol. 3, VINITI, Moscow (1990).Google Scholar
  6. 6.
    Yu. V. Kapitonova and N. S. Kovalenko, “Resource allocation for competing processes”, Kibernetika, No. 3, 17–20 (1981).Google Scholar
  7. 7.
    Yu. V. Kapitonova, N. S. Kovalenko, and M. I. Ovseets, “Efficiency and optimality of one method of software resource allocation in multiprocessor computing systems”, Kibernetika, No. 6, 23–27 (1983).MathSciNetGoogle Scholar
  8. 8.
    Yu. V. Kapitonova, P. S. Klyaus, and N. S. Kovalenko, “Optimal organization of one class of parallel processes”, Programmirovanie, No. 4, 48–56 (1984).MathSciNetGoogle Scholar
  9. 9.
    V. S. Tanaev, Yu. N. Sotskov, and V. A. Strusevich, Theory of Schedules. Multistage Systems [in Russian], Nauka, Moscow (1989).Google Scholar
  10. 10.
    F. R. Gantmakher, Matrix Theory [in Russian], Nauka, Moscow (1988).Google Scholar
  11. 11.
    N. S. Kovalenko, M. I. Ovseets, and M. I. Yaznevich, “Features of pipeline organization of distributed competing processes”, in: Topics in Cybernetics. Development and Use of Supercomputers [in Russian], Moscow (1987), pp. 104–111.Google Scholar
  12. 12.
    Yu. V. Kapitonova, N. S. Kovalenko, and M. I. Ovseets, “Efficiency of pipelined execution of competing processes with a limited number of copies of the software resource”, Kibernetika, No. 3, 60–65 (1989).MathSciNetGoogle Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • N. S. Kovalenko
  • V. M. Metel'skii

There are no affiliations available

Personalised recommendations