Execution time of competing processes in distribution processing

DOI10.1007/BF02366580zbMath0879.68038MaRDI QIDQ1364108

N. S. Kovalenko, V. M. Metel'skiĭ

Publication date: 17 December 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

multiprocessor systemsdistributed processing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical problems of computer architecture (68M07)

Related Items (1)

Asynchronous distributed computations with a limited number of copies of a structured program resource

Cites Work

• Optimal organization of a class of parallel processes
• Efficiency and optimality of one method of distributing program resources in multiprocessor computer systems
• Parallel Computers 2
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Execution time of competing processes in distribution processing