The relation between computing time, stage length, and frequency of random machine errors

The article shows how to determine the length of the parts (stages) into which a program should be divided to guard against random machine errors and to give the least possible computing time. A numerical example is given for a “Strela” machine.