Cybernetics and programmingReference:
The method of forming the load on the arcs of the search graph of the shortest Hamiltonian path in relation to solving the problem of scheduling the implementation of multiple transactions and queries in a network database
Abstract.The subject of the research is network databases of distributed computing systems. The object of the research is the model and scheduling algorithms for the distribution of workload in network databases. The author considers in detail such aspects of the topic as a model for solving the problem of optimizing the process of managing queries in distributed information systems. It is shown that in order to eliminate the queue of requests, it is necessary to choose the most appropriate way to select queries and the best method for implementing the selected method. Promising options for serving queries are group sampling, as well as group sampling with individual segmentation. Special attention is paid to the application and development of a method for solving problems of Boolean linear and nonlinear programming based on the rank approach, which have a small time complexity and provide the required accuracy for solving these problems, as well as developing a common approach to solving arbitrary problems of boolean programming. The research methodology is the methods and models for planning, optimizing and improving the performance of network databases of distributed computing systems. The scientific novelty lies in the fact that an increase in the number of constraints in problems of nonlinear Boolean programming leads to a decrease in the error of their solution, and the degree of nonlinearity itself does not significantly affect the magnitude of the error. From an experimental study of the developed algorithms for solving the problems considered in the work, it follows that in the case of the formalization of Boolean programming problems in graph formulation, in most cases it is possible to reduce the time complexity of the algorithms for solving them. The proposed model can be used to solve the problem of optimizing the process of managing queries in distributed computing systems.
Keywords: deviation, transaction, branch and bound, ranked approach, optimization, request, dissipative structures, network database, hamiltonian path, algorithm analysis
Article was received:17-06-2018
This article written in Russian. You can find full text of article in Russian here .
The journal allows the author(s) to hold the copyright without restrictions. All authors automatically own full copyright in their work as soon as they create it, and current Russian Federal legislation protects them.
Licence type: Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
The journal is an open access journal which means that everybody can read, download, copy, distribute, print, search, or link to the full texts of these articles in accordance with Creative Commons Attribution- NonCommercial 4.0 International License.
You are free to:
Share — copy and redistribute the material in any medium or format.
Adapt — remix, transform, and build upon the material The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.