Оптимальное дублирование заданий в вычислительной системе
Чернов Илья Александрович · Proceedings of the Karelian Research Centre of the Russian Academy of Sciences · 2014
We consider a model of a grid computing system solving recognition problems. Computers produce the correct answer with some known probability. Each problem is solved up to a fixed number (quorum) of identical answers; this redundancy allows reducing the risk of producing the wrong answer but requires additional time. The cost function is the sum of the computational time and penalty in case of the wrong answer. We reveal the conditions when such redundancy is advantageous and show how the optimal quorum can be determined.
Cited by 0 works.