Comparative analysis of Delaunay’s triangulation algorithms for the construction of three-dimensional fractal objects
The analysis of the task of fragmentation of the data of the network database showed that the formal model is the so-called integer linear programming problem with Boolean variables. Unfortunately, the problem of CAP with BP belongs to the class NP (non-deterministic polynomial), which are difficult to solve even with the use of modern computers. At present, combinatorial methods occupy a dominant place in the methods of solving these problems. To them, first of all, you can include methods of full busting, dynamic programming, and also local algorithms. The practical application of these methods is difficult in solving problems of large dimension. Attempts to reduce the time for solving the problems of CML with BP due to parallelization face another problem in the theory of parallel computations, which consists in the fact that, from the point of view of parallel algorithms, this type of problem belongs to the class of strongly coupled tasks and therefore can not be paralleled. Therefore, when developing parallel algorithms for solving the problem of CML with BP, in addition to the contradiction between the accuracy of the solution of the problem and the time of its solution, another contradiction arises - between the strong connectivity inherent in this task and the need for its parallelization.The proposed method of parallel computing for fragmentation of network database data is based on a rank approach to its solution, the principle of optimization in the direction and strategies for cutting off unpromising solutions. The method allows to determine local extrema at the vertices of the graph and on their basis to determine the global extremum.