Abstract
Abstract The paper proposes an approach to solving the problem of optimal placement of data array replicas in a distributed system. It presents a formal model of a distributed system with unreliable communication channels. A system is represented as a graph with coloured arcs. The formulation of the problem of finding the optimal placement of replicas is given. As a criterion for optimization, the minimum response time to a data request is considered. The task solution heuristic algorithm is also proposed in the paper.
Highlights
Various requirements are imposed on the characteristics of distributed data processing systems (DDPS)
The article deals with the problem of finding the optimal distribution of replicas of several data arrays in the nodes of a distributed system operating on the basis of a computer network with unreliable communication channels
It is necessary to place the replicas of M data arrays in the nodes of the distributed system in a way that ensures the minimum value of the F(A) functional
Summary
Various requirements are imposed on the characteristics of distributed data processing systems (DDPS). The tasks of finding the optimal location of replicas in distributed systems are computationally complex. This is especially true for large-scale systems. To solve such problems, various methods are used to reduce their computational complexity [1]–[5]. The article deals with the problem of finding the optimal distribution of replicas of several data arrays in the nodes of a distributed system operating on the basis of a computer network with unreliable communication channels. The task uses restrictions on the maximum cost of the system and the limit on the maximum number of replicas located in one network node
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
