This article describes the stages of implementing the program to solve the task of calculating the average response time of a distributed information processing system to user requests and an algorithm for the optimal distribution of information relations over the nodes of a distributed information processing system implemented on the basis of a file server architecture and a two-tier client server architecture, with and without locks. The procedure for constructing the initial data for modeling is described: the elements of the matrix of the initial distribution of information resources (relations) over the nodes of the distributed information processing system, the elements of the matrix of information interrelation between the requests of users of the distributed information processing system and the information resources themselves, the elements of the matrix of probabilities for generating queries by users. A procedure has been developed and programmed to significantly simplify the calculation of the normalizing constant, and accordingly the average response time of the system to user requests. The results of numerical experiments are presented

Keywords: Distributed information processing system, file-server architecture, two-level client-server architecture, nonlinear combinatorial optimization, generator of equiprobable choice, Jordan-Gauss method, normalized constant, average reaction time of the syste

In this article to solve the problem of optimal distribution of information resources over the nodes of distributed inorganic system according to the criterion of minimum of the medium time, the response of the system to the requests of the users an original heuristic algorithm is proposed that uses the notion of databases as points of a mulltidimensional space, but about nodes in which these bases are placed as clasters. The resuts of numerical experiments are presennted depending on the architecture of the distributed system used and on the method of ensuring data integrity. Numerical experiments showed rather high efficiency of the proposed algorithm.

Keywords: Distributed information system, distributed data base, local computing system, mass service network, non-lineare combinatorial optimization, query generation, a matrix of probabilities for generating queries by users, a matrix for distributing relations a