Execution time of competing processes in distribution processing

DOI10.1007/BF02366580MaRDI QIDQ1364108zbMATH OpenFDO

Authors 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

distributed processingmultiprocessor systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 882118
• Organization of distributed processing of concurrent processes in synchronous modes.
• Optimality of systems of identically distributed competing processes
• Optimization of the number of processors in realizing nonhomogeneous distributed competing processes
• Homogeneous parallel processors

Cites work

• scientific article; zbMATH DE number 20260 (Why is no real title available?)
• scientific article; zbMATH DE number 41713 (Why is no real title available?)
• scientific article; zbMATH DE number 706866 (Why is no real title available?)
• Efficiency and optimality of one method of distributing program resources in multiprocessor computer systems
• Optimal organization of a class of parallel processes
• Parallel Computers 2

Cited in

(6)

• Homogeneous parallel processors
• Organization of distributed processing of concurrent processes in synchronous modes.
• Why parallel computer processing systems are preferred to serial computer processing systems: a formal discussion
• Average execution times of series-parallel networks
• Asynchronous distributed computations with a limited number of copies of a structured program resource
• Optimality of systems of identically distributed competing processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364108)