Abstract
New mathematical models of optimal distribution of databases replication in nodes of distributed information systems are formulated by the criteria: minimization of maintenance costs; restricted memory resources; minimizing synchronization time; minimizing the average time needed to search information. Precise solutions of the problems with the use of dynamic programming methods are constructed, Bellman recursive equations are obtained. The general scheme of the computational algorithm using the “greedy” choice procedure is presented and an algorithm for improving the obtained result is proposed. The strategies of greedy choice were investigated, the choice of criteria in the strategy of greedy choice is substantiated. The proposals have been formed regarding the formation of a balance between the accuracy and computational complexity of the algorithm through the introduction of a restricted search strategy. The computational complexity of the algorithm is estimated and its correctness is substantiated.
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.
