ON THE BOUNDS OF THE POLYNOMIALS\' ROOTS IDENTIFICATION BASED ON STABLE ADDRESS SORTING

Ya.E. Romm

doi:10.17513/snt.38959

ON THE BOUNDS OF THE POLYNOMIALS\' ROOTS IDENTIFICATION BASED ON STABLE ADDRESS SORTING

Современные наукоемкие технологии (Modern High Technologies) ◽

10.17513/snt.38959 ◽

2021 ◽

Vol 1 (№12 2021) ◽

pp. 84-108

Author(s):

Ya.E. Romm

Keyword(s):

Address Sorting

Download Full-text

Parallel construction of binary tree based on sorting

Vestnik of Don State Technical University ◽

10.23947/1992-5980-2018-18-4-449-454 ◽

2019 ◽

Vol 18 (4) ◽

pp. 449-454

Author(s):

Ya. E. Romm ◽

D. A. Chabanyuk

Keyword(s):

Data Structures ◽

Binary Tree ◽

Time Complexity ◽

Binary Data ◽

Relational Databases ◽

Input Sequence ◽

Mutual Transformation ◽

One To One ◽

Parallel Construction ◽

Address Sorting

Introduction. Algorithms for the parallel binary tree construction are developed. The algorithms are based on sorting and described in a constructive form. For the Nelement set, the time complexity has T(R) = O(1) and T(R) = O(log2N) estimates, where R = (N2-N)/2 is the number of processors. The tree is built with the uniqueness property. The algorithms are invariant with respect to the input sequence type. The work objective is to develop and study ways of accelerating the process of organizing and transforming the tree-like data structures on the basis of the stable maximum parallel sorting algorithms for their application to the basic operations of information retrieval on databases.Materials and Methods.A one-to-one relation between the input element set and the binary tree built for it is established using a stable address sorting. The sorting provides maximum concurrency, and, in an operator form, establishes a one-to-one mapping of input and output indices. On this basis, methods for the mutual transformation of the binary data structures are being developed.Research Results.An efficient parallel algorithm for constructing a binary tree based on the address sorting with time complexity of T(N2) = O(log2N) is obtained. From the well-known analogues, the algorithm differs in structure and logarithmic estimation of time complexity, which makes it possible to achieve the acceleration of O(Nα), α≥1 order analogues. As an advanced version, an algorithm modification, which provides the maximum parallel construction of the binary tree based on a stable address sorting and a priori calculation of the stored subtree root indices is suggested. The algorithm differs in structure and estimation of T(1) = O(1) time complexity. A similar estimate is achieved in a sequential version of the modified algorithm, which allows obtaining the acceleration of known analogs O(Nα), α>1 order.Discussion and Conclusions.The results obtained are focused on the creation of effective methods for the dynamic database processing. The proposed methods and algorithms can form an algorithmic basis for an advanced deterministic search on the relational databases and information systems.

Download Full-text