The game-theoretical approach to organizing dispatching distributed computing systems (CS) in the state of maintaining a stream of parallel tasks is developed. Parallel algorithms of seeking for the optimal mixed strategies for choice of tasks for solution on not absolutely reliable CS are proposed. Results on parallel simulation of distributed CS functioning are presented.
展开▼
