Optimizing the execution time of a desktop grid project

A model of computation time of a project in a Desktop Grid is viewed, under the following restrictions: the number of nodes is stationary, it takes each task the same time equal to deadline to complete, under the condition of deadline violation the task is to be calculated again. An inequality connecting probability of a single error in calculation of a task, number of replicas and number of tasks is concluded that shows when replication is necessary. An inequality connecting number of replicas, probability of a single error and penalty for error is concluded, which shows when replication is profitable. (\emph{in Russian}).