Optimality of systems of identically distributed competing processes

DOI10.1007/S10559-006-0017-3zbMATH Open1102.68012OpenAlexW2025990469MaRDI QIDQ852239FDOQ852239

Authors: Yu. V. Kapitonova, N. S. Kovalenko, P. A. Pavlov 

Publication date: 28 November 2006

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

Full work available at URL: https://doi.org/10.1007/s10559-006-0017-3

Recommendations

• Optimization of the number of processors in realizing nonhomogeneous distributed competing processes
• scientific article; zbMATH DE number 1905094
• Execution time of competing processes in distribution processing
• Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
• scientific article; zbMATH DE number 1902275

zbMATH Keywords

multiprocessor systemsoptimal distribution of computational resources

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Uniform bounds for strongly competing systems: the optimal Lipschitz case
• Search for optimal strategies for accessing the set of critical resources of multiprocessor systems
• Optimization of the number of processors in realizing nonhomogeneous distributed competing processes
• Organization of distributed processing of concurrent processes in synchronous modes.
• Effectiveness of utilizing the resources of parallel computing systems for the allocation of data files in computer memory
• Optimization of parallel common memory interface for multiprocessor computer systems
• Title not available (Why is that?)
• Asynchronous distributed computations with a limited number of copies of a structured program resource
• Paired discrete competition with a free route choice

This page was built for publication: Optimality of systems of identically distributed competing processes

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