Recovery schemes for distributed computing based on BIB-schemes

It was investigational on the basis of the considered existent methods, that the task of exposure of optimal recovery scheme answers the mathematical task of BIB-schemes. In the process of work the recovery scheme was worked out on the basis of BIB-schemes, which works for the greater number of the damaged computers, what other existent charts. Recovery scheme of distributed system that guarantees optimal load of distribution in the worst case, when k computers went down, is an optimal recovery scheme with criteria of even load value of n and k based on IRB. This recovery scheme to provide optimal renewal for any amount of computers in a cluster.

[1]  Lars Lundberg,et al.  Recovery schemes for high availability and high performance distributed real-time computing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[2]  Dmytro Peleshko,et al.  Morphological processing of videostream frames binary masks , 2015, 2015 Xth International Scientific and Technical Conference "Computer Sciences and Information Technologies" (CSIT).

[3]  Lars Lundberg,et al.  Optimal recovery schemes in fault tolerant distributed computing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[4]  Lars Lundberg,et al.  Optimal Recovery Schemes for High-Availability Cluster and Distributed Computing , 2001, J. Parallel Distributed Comput..

[5]  Ivan Izonin,et al.  Adaptive moving object segmentation algorithms in cluttered environments , 2015, The Experience of Designing and Application of CAD Systems in Microelectronics.

[6]  Y. Rashkevych,et al.  Optimization search process in database of learning system , 2003, Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings.