Execution time of competing processes in distributed processing
KeywordsOperating 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.
- 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.Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).Google Scholar
- 4.R. Hockney and C. Jesshope, Parallel Computers: Architecture, Programming, and Algorithms [Russian translation], Radio i Svyaz', Moscow (1986).Google Scholar
- 5.A. P. Chernyaev, “Programming systems for high-performance computers”, in: Computer Science [in Russian], Vol. 3, VINITI, Moscow (1990).Google Scholar
- 6.Yu. V. Kapitonova and N. S. Kovalenko, “Resource allocation for competing processes”, Kibernetika, No. 3, 17–20 (1981).Google Scholar
- 9.V. S. Tanaev, Yu. N. Sotskov, and V. A. Strusevich, Theory of Schedules. Multistage Systems [in Russian], Nauka, Moscow (1989).Google Scholar
- 10.F. R. Gantmakher, Matrix Theory [in Russian], Nauka, Moscow (1988).Google Scholar
- 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
© Plenum Publishing Corporation 1996