Critical rate of computing net increase for providing the infinity faultless work

Koganov A.V., Sazonov A.N.
 pdf (176K)  / List of references

Fault-tolerance of a finite computing net with arbitrary graph, containing elements with certain probability of fault and restore, is analyzed. Algorithm for net growth at each work cycle is suggested. It is shown that if the rate of net increase is sufficiently big then the probability of infinity faultless work is positive. Estimated critical net increase rate is logarithmic over the number of work cycles.

Keywords: computing net, graph theory, failsoft
Citation in English: Koganov A.V., Sazonov A.N. Critical rate of computing net increase for providing the infinity faultless work // Computer Research and Modeling, 2009, vol. 1, no. 1, pp. 33-39
Citation in English: Koganov A.V., Sazonov A.N. Critical rate of computing net increase for providing the infinity faultless work // Computer Research and Modeling, 2009, vol. 1, no. 1, pp. 33-39
DOI: 10.20537/2076-7633-2009-1-1-33-39
URL: http://crm-en.ics.org.ru/journal/article/1572/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science