Optimality of systems of identically distributed competing processes
From MaRDI portal
Publication:852239
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
Cited in
(10)- scientific article; zbMATH DE number 3920334 (Why is no real title available?)
- Organization of distributed processing of concurrent processes in synchronous modes.
- Optimization of parallel common memory interface for multiprocessor computer systems
- Optimization of the number of processors in realizing nonhomogeneous distributed competing processes
- scientific article; zbMATH DE number 1905094 (Why is no real title available?)
- Effectiveness of utilizing the resources of parallel computing systems for the allocation of data files in computer memory
- Asynchronous distributed computations with a limited number of copies of a structured program resource
- Uniform bounds for strongly competing systems: the optimal Lipschitz case
- Paired discrete competition with a free route choice
- Search for optimal strategies for accessing the set of critical resources of multiprocessor systems
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)