Failure-proof methods of providing mutual information-wise coordination in distributed computing systems

The paper us concerned with a statement of the problem of information-wise coordination, also known as the problem of Byzantine generals, in decentralized distributed computing systems. Solution of this problem unifies development of failure-proof application and system software algorithms for distributed computing systems. Deterministic and randomized mutual informationwise coordination algorithms and their applications, in particular, to uniform time service of a distributed system are discussed.