Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 1 (1961) no. 1, pp. 163-168
Citer cet article
V. I. Sobel'man. The relation between computing time, stage length, and frequency of random machine errors. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 1 (1961) no. 1, pp. 163-168. http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_1_a10/
@article{ZVMMF_1961_1_1_a10,
author = {V. I. Sobel'man},
title = {The relation between computing time, stage length, and frequency of random machine errors},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {163--168},
year = {1961},
volume = {1},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_1_a10/}
}
TY - JOUR
AU - V. I. Sobel'man
TI - The relation between computing time, stage length, and frequency of random machine errors
JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY - 1961
SP - 163
EP - 168
VL - 1
IS - 1
UR - http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_1_a10/
LA - ru
ID - ZVMMF_1961_1_1_a10
ER -
%0 Journal Article
%A V. I. Sobel'man
%T The relation between computing time, stage length, and frequency of random machine errors
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1961
%P 163-168
%V 1
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_1_a10/
%G ru
%F ZVMMF_1961_1_1_a10
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.
